Kruskal14分求助

#include<bits/stdc++.h>
using namespace std;
int n,m,fa[5001],i,ans=-1;
bool f=false;
struct node{
    int x,y,z;
}b[200001];
bool cmp(node aa,node bb){
    if(aa.z!=bb.z) return aa.z<bb.z;
}
int find(int x){
    if(fa[x]==x) return x;
    else return find(fa[x]);
}
int main(){
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++){
        fa[i]=i;
    }
    for(i=1;i<=m;i++){
        scanf("%d%d%d",&b[i].x,&b[i].y,&b[i].z);
    }
    sort(b+1,b+m+1,cmp);
    i=1;
    while(i<=m){
        if(i==n){
            break;
        }
        if(find(b[i].x)!=find(b[i].y)){
            fa[b[i].y]=find(b[i].x);
            ans+=b[i].z;
            i++;
        }
    }
    if(ans<0) printf("org");
    else printf("%d",ans+1);
    return 0;
}

记录