数据中好像有不能连同的情况......

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N = 305 ,	M= 5e5+5;
int n,m,cnt;
int fa[N];
struct node{
	int x,y,w;
}edg[M];
bool cmp(node a,node b)
{
	return a.w < b.w;
}
int find(int x)
{
	if(fa[x]!=x) return fa[x] = find(fa[x]);
	return x;
}
bool union_set(int x,int y)
{
	x = find(x);
	y = find(y);
	if(x==y) return false;
	else fa[x] = y; 
	
}


int main()
{
	cin >> n >> m;
	for(int i=1;i<=n;i++) fa[i] = i;
	for(int i=1;i<=m;i++)
	{
		cin >> edg[i].x >> edg[i].y >> edg[i].w; 
	}
	sort(edg+1,edg+1+m,cmp);
	int res =0;
	for(int i=1;i<=m;i++)
	{
		int x = edg[i].x;
		int y = edg[i].y;
		int w = edg[i].w;
		if(union_set(x,y))
		{
			cnt++;
			res = w;
//			cout << x << " " << y << endl;
			if(cnt==n-1)
			{
				//放在这里不能通过
				break;
			}
		}
	}
	cout << n-1 << " " << res; 

	return 0;
}