Pagini recente » Borderou de evaluare (job #267240) | Rezultatele filtrării | Cod sursa (job #2296560) | Cod sursa (job #1695498) | Cod sursa (job #1416520)
#include <stdio.h>
#include <vector>
#include <algorithm>
#define MAx 400100
using namespace std;
int n, m, t[MAx], viz[MAx];
FILE*f=fopen("apm.in","r"),*g=fopen("apm.out","w");
struct graf
{
int x, y,c;
}l[MAx];
bool cmp(graf a, graf b)
{
if(a.c > b.c)
return 0;
return 1;
}
int tata(int x)
{
while(t[x] != x)
x = t[x];
return x;
}
int main()
{
int x, y, c;
fscanf(f,"%d %d",&n,&m);
for(int i = 1; i <= m; i++)
{
fscanf(f,"%d %d %d",&l[i].x,&l[i].y,&l[i].c);
t[i] = i;
}
sort(l + 1, l + m + 1, cmp);
int s = 0, tx, ty, nr = 0;
for(int i = 1; i <= m; i++)
{
tx = tata(l[i].x);
ty = tata(l[i].y);
if(tx != ty)
{
viz[i] = 1;
t[tx] = ty;
s += l[i].c;
nr++;
}
}
fprintf(g,"%d\n%d\n",s,nr);
for(int i = 1; i <= m; i++)
{
if(viz[i] == 1)
fprintf(g,"%d %d\n",l[i].x, l[i].y);
}
return 0;
}