生成树模板

bool operator <(rec a,rec b){
    return a.z<b.z;
}

IN int get(int x){
    if(x==fa[x]) return x;
    return fa[x]=get(fa[x]);
}

int main(){
    int n,m,ans=0,cnt=0;
    scanf("%d %d",&n,&m);
    REP(i,1,m)
        scanf("%d %d %d",&edge[i].x,&edge[i].y,&edge[i].z);
    sort(edge+1,edge+1+m);
    REP(i,1,n) fa[i]=i;
    REP(i,1,m){
        int x=get(edge[i].x),y=get(edge[i].y);
        if(x==y) continue;
        fa[x]=y;
        ans+=edge[i].z;
        cnt++;
        if(cnt==n-1) break;
    }
    if(cnt!=n-1) printf("orz");
    else printf("%d",ans);