C++11(clang++ 3.9) 解法, 执行用时: 15ms, 内存消耗: 632K, 提交时间: 2019-07-30 15:00:58

#include<bits/stdc++.h>
using namespace std;
const int N=310;
int n,m,f[N],cnt,res;
struct node{
	int u,v,w;
}t[10010];
int cmp(node a,node b){
	return a.w<b.w;
}
int find(int x){
	return x==f[x]?x:f[x]=find(f[x]);
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)	f[i]=i;
	for(int i=1;i<=m;i++)	cin>>t[i].u>>t[i].v>>t[i].w;
	sort(t+1,t+1+m,cmp);
	for(int i=1;i<=m&&cnt<n-1;i++){
		int fa=find(t[i].u);	int fb=find(t[i].v);
		if(fa!=fb){
			f[fa]=fb;	cnt++;	res=t[i].w;
		}
	}
	cout<<n-1<<' '<<res<<endl;
	return 0;
}

Python3 解法, 执行用时: 96ms, 内存消耗: 6224K, 提交时间: 2022-09-22 21:33:54

n, m = map(int , input().split())
edges = [list(map(int, input().split())) for _ in range(m)]
edges.sort(key = lambda x: (x[2]))
p = [i for i in range(n + 1)]
def find(x):
    if x != p[x]: p[x] = find(p[x])
    return p[x]
ans = 0;
for i in range(m):
    a, b = find(edges[i][0]), find(edges[i][1])
    if a != b:
        p[a] = b
        ans = edges[i][2]
print(n - 1, ans)