bzoj1083: [SCOI2005]繁忙的都市 MST

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
struct node
{
int v,u,val;
}edge[20000];
int n,e;
int father[20000];
bool cmp(node aa,node bb)
{
return aa.val<bb.val;
}
int getfather(int x)
{
if(father[x]==x) return x;
father[x]=getfather(father[x]);
return father[x];
}
int main()
{
int x,y,z;
scanf("%d%d",&n,&e);
for(int i=1;i<=n;i++)
father[i]=i;
for(int i=1;i<=e;i++)
{
scanf("%d%d%d",&edge[i].v,&edge[i].u,&edge[i].val);
}
sort(edge+1,edge+1+e,cmp);
int ans=0;
for(int i=1;i<=e;i++)
{
int r1=getfather(edge[i].v);
int r2=getfather(edge[i].u);
if(r1!=r2)
{
father[r1]=r2;
ans=max(ans,edge[i].val);
}
}
printf("%d %d",n-1,ans);
return 0;
}