学步园

#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
} 
struct data{
	int x,y,v;
}e[10001];
int n,m,ans,fa[301];
inline bool cmp(data a,data b){return a.v<b.v;}
inline int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
int main(){
	n=read();m=read();
	for(int i=1;i<=n;i++)fa[i]=i;
	for(int i=1;i<=m;i++){
		e[i].x=read();e[i].y=read();e[i].v=read();
	}
	sort(e+1,e+m+1,cmp);
	for(int i=1;i<=m;i++){
		int p=find(e[i].x),q=find(e[i].y);
		if(p!=q){fa[p]=fa[q];ans=max(e[i].v,ans);}
	}
	printf("%d %d",n-1,ans);
	return 0;
}