最小瓶颈生成树 = 最小生成树
水过。
/* Footprints In The Blood Soaked Snow */
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 305, maxm = 50005;
int n, m, fa[maxn];
struct _edge {
int u, v, w;
bool operator < (const _edge &x) const {
return w < x.w;
}
} g[maxm];
inline int iread() {
int f = 1, x = 0; char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';
return f * x;
}
inline int find(int x) {
return fa[x] == x ? x : fa[x] = find(fa[x]);
}
int main() {
n = iread(); m = iread();
for(int i = 1; i <= n; i++) fa[i] = i;
for(int i = 1; i <= m; i++) {
int u = iread(), v = iread(), w = iread();
g[i] = (_edge){u, v, w};
}
sort(g + 1, g + 1 + m);
int cnt = 0, now = 1;
for(; cnt != n - 1; now++) {
int u = find(g[now].u), v = find(g[now].v);
if(u != v) fa[u] = v, cnt++;
}
printf("%d %d\n", n - 1, g[now - 1].w);
return 0;
}