Vijos 1234 pockets of the sky

Minimum spanning Tree kruscal algorithm

#include <iostream> #include <algorithm> #include <cstring> #define MAXN 10005using namespace std; struct stu{int x,y;int t;}; Stu Mapp[maxn];int f[1005];int n,m,k,sum,flag;bool cmp (stu X,stu y) {return x.t<y.t;} int  dfs (int x) {if (f[x]!=x) F[x]=dfs (f[x]); return f[x];} void build (int x) {if (Dfs (mapp[x].x)!=dfs (mapp[x].y)) {F[dfs (mapp[x].x)]=dfs (MAPP[X].Y); sum+=mapp[x].t;}} int solve () {int re=0;for (int i=1;i<=n;i++) {if (f[i]==i) re++;}  

Vijos 1234 pockets of the sky