洛谷P2330 [SCOI2005]繁忙的都市——kruskal

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<cmath>
using namespace std;
const int M=2e5+7;
int read(){
    int ans=0,f=1,c=getchar();
    while(c<‘0‘||c>‘9‘){if(c==‘-‘) f=-1; c=getchar();}
    while(c>=‘0‘&&c<=‘9‘){ans=ans*10+(c-‘0‘); c=getchar();}
    return ans*f;
}
int n,m,ans;
struct node{int from,to,w;}e[M];
int cmp(node x,node y){return x.w<y.w;}
int f[M],T;
int find(int x){return f[x]==x?x:f[x]=find(f[x]);}    
int main(){
    n=read(); m=read(); T=n;
    for(int i=1;i<=n;i++) f[i]=i;
    for(int i=1;i<=m;i++) e[i].from=read(),e[i].to=read(),e[i].w=read();
    sort(e+1,e+1+m,cmp);
    for(int i=1;i<=m&&T>1;ans=i,i++){
        int p=find(e[i].from),q=find(e[i].to);
        if(p==q) continue;
        f[p]=q; T--;
    }
    printf("%d %d\n",n-1,e[ans].w);
    return 0;
}