Pagini recente » Cod sursa (job #1906941) | Cod sursa (job #249311) | Cod sursa (job #401872) | Cod sursa (job #2643766) | Cod sursa (job #892433)
Cod sursa(job #892433)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
struct muc
{
int x,y,c;
}v[200001];
int i,j,n,m,cost,viz[200001],s,nr,rez[2][200001],w,aux1,aux2;
int cmp(const muc a,const muc b)
{
return a.c<b.c;
}
int main()
{
fin>>n>>m;
for(i=1;i<=m;++i)
fin>>v[i].x>>v[i].y>>v[i].c;
sort(v+1,v+m+1,cmp);
for(i=1;i<=n;++i)
viz[i]=i;
for(i=1;i<=m;++i)
if(viz[v[i].y]!=viz[v[i].x])
{
nr++;
s+=v[i].c;
if(viz[v[i].x]<viz[v[i].y])
{
aux1=viz[v[i].x];
aux2=viz[v[i].y];
}
else
{
aux1=viz[v[i].y];
aux2=viz[v[i].x];
}
for(j=1;j<=n;++j)
if(viz[j]==aux2)
viz[j]=aux1;
w++;
rez[0][w]=v[i].x;
rez[1][w]=v[i].y;
}
fout<<s<<'\n';
fout<<w<<'\n';
for(i=1;i<=w;++i)
fout<<rez[0][i]<<" "<<rez[1][i]<<'\n';
return 0;
}