L - Networking

https://vjudge.net/contest/280495#problem/L

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
struct str{
   int x,y,z;
   bool operator<(const str &str1)const{
     return z<str1.z;
    }
}a[1000000];
int n,m,i,j,x1,y1,k,l,ans,f[1000000];
int find(int x)
{
    if (f[x]==x) return x;
    return f[x]=find(f[x]);
}
int main(){
   while (~scanf("%d",&n)){
    if (n==0) break;
    scanf("%d",&m);
    ans=0;
    k=0;
    for (i=1;i<=n;i++)
        f[i]=i;
    for (i=1;i<=m;i++)
       scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z);
    sort(a+1,a+m+1);
    for (i=1;i<=m;i++){
        if (k==n) break;
        x1=find(a[i].x);
        y1=find(a[i].y);
        if (x1==y1) continue;
        f[x1]=y1;
        k++;
        ans+=a[i].z;
    }
    printf("%d\n",ans);
   }
}