裸的kruskal

#include<iostream>
#include<cstdio>
#include<algorithm> 
using namespace std;
int n,m,fa[305],maxx,k;
struct cd{
    int x;
    int y;
    int v;
};
cd lu[50005];
int father(int x)
{
    if(fa[x]!=x)fa[x]=father(fa[x]);
    return fa[x];
}
int unionn(int x,int y)
{
    int fa1=father(x);
    int fb1=father(y);
    if(fa1!=fb1)fa[fa1]=fb1;
}
int cmp(const cd &a,const cd &b)
{
    if(a.v<b.v)return 1;
    else
    return 0;
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>lu[i].x>>lu[i].y>>lu[i].v;
    }
    for(int i=1;i<=n;i++)
    fa[i]=i;
    sort(lu+1,lu+m+1,cmp);
    for(int i=1;i<=m;i++)
    {
        if(father(lu[i].x)!=father(lu[i].y))
        {
            unionn(lu[i].x,lu[i].y);
            k++;
            if(lu[i].v>maxx)
            maxx=lu[i].v;
        }if(k==n-1)break;
    }
    cout<<k<<" "<<maxx<<endl;
    return 0;
}