【Kruskal】P2330 [SCOI2005]繁忙的都市

#include<iostream>
#include<algorithm>
using namespace std;

int fa[301];

int find(int x)
{
    if (x == fa[x]) return x;
    fa[x] = find(fa[x]);
    return fa[x];
}

struct Edge
{
    int u, v, w;
    bool operator <(Edge s)
    {
        return w < s.w;
    }
}e[100010];

int n, m;

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        if(i<=n) fa[i] = i;
        int a, b, c;
        cin >> a >> b >> c;
        e[i].u = a;
        e[i].v = b;
        e[i].w = c;
    }
    sort(e + 1, e + m + 1);
    int tot = 0;
    int maxs = -1;
    for (int i = 1; i <= m; i++)
    {
        if (find(e[i].u) != find(e[i].v))
        {
            maxs = max(maxs, e[i].w);
            fa[find(e[i].u)] = e[i].v;
            tot++;
            if (tot >= n - 1)
            {
                cout << tot << " " << maxs;
                return 0;
            }
        }
    }
}