HDOJ 1863 Kruskal算法

#include"iostream"
#include"algorithm"
using namespace std;
const int maxn=5010;
int pre[maxn];
int rk[maxn];
void init(int n)
{
    for(int i=1;i<=n;i++)
    {
        rk[i]=0;
        pre[i]=i;
    }
}
int find(int x)
{
    return pre[x]==x?x:pre[x]=find(pre[x]);
}
bool join(int x,int y)
{
    x=find(x);
    y=find(y);
    if(x!=y)
    {
        if(rk[x]==rk[y])
        {
            pre[y]=x;
            rk[x]++;
        }
        else if(rk[x]>rk[y])
            pre[y]=x;
        else 
            pre[x]=y;
        return true;
    }
    return false;
}
struct road{
    int u,v,w;
}r[maxn];
bool cmp(road a,road b)
{
    return a.w<b.w;
}
int main()
{
    //freopen("a.txt","r",stdin);
    int n,m;
    while(cin>>m>>n,m)
    {
        init(n);
        for(int i=0;i<m;i++)
            cin>>r[i].u>>r[i].v>>r[i].w;
        sort(r,r+m,cmp);
        int ans=0;
        int count=0;
        for(int i=0;i<m;i++)
        {
            int s=r[i].w;
            if(join(r[i].u,r[i].v)) {count++;ans+=s;}
            if(count==n-1)
                break;
        }
        if(count!=n-1)
            cout<<"?"<<endl;
        else
            cout<<ans<<endl;

    }
    return 0;
}