洛谷P1111

#include <bits/stdc++.h>
using namespace std;
int n, m;
const int N = 1e5 + 10;
int p[N];
struct edge
{
    int x, y, t;
}Edge[N];
bool cmp(edge a, edge b)
{
    return a.t < b.t;
}
int find(int x)
{
    if(p[x] != x) p[x] = find(p[x]);
    return p[x];
}
int main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++) p[i] = i;
    for(int i = 1; i <= m; i++)
        cin >> Edge[i].x >> Edge[i].y >> Edge[i].t;
    sort(Edge + 1, Edge + 1 + m, cmp);
    for(int i = 1; i <= m; i++)
    {
        if(find(Edge[i].x) != find(Edge[i].y))
        {
            p[find(Edge[i].x)] = find(Edge[i].y);
            n--;
        }
        if(n == 1)
        {
            cout << Edge[i].t << endl;
            return 0;
        }
    }
    cout << -1 << endl;
    return 0;
}

运行结果