直接放模板:
//kruskal:
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct node{
int x,y,v;}e[90005];
int f[305],n,m,k=0,ans;
int find(int x){return f[x]==x?x:f[x]=find(f[x]);}
void unionn(int x,int y){int t1=find(x); int t2=find(y);if(t1!=t2)f[t2]=t1;}
bool cmp(node a,node b){ return a.v<b.v;}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)f[i]=i;
for(int i=1;i<=m;i++)scanf("%d%d%d",&e[i].x,&e[i].y,&e[i].v);
sort(e+1,e+m+1,cmp);
for(int i=1;i<=m;i++){
if(find(e[i].x)!=find(e[i].y)){
unionn(e[i].x,e[i].y);k++;ans=e[i].v;
}
if(k==m-1)break;
}
printf("%d %d",k,ans);
return 0;
}