洛谷 P3366 【模板】最小生成树

题目链接：https://www.luogu.com.cn/problem/P3366

---

模板题，稀疏图，使用kruskal算法。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 5010, M = 200010;

int n, m;
int f[M];

struct Edges{
    int a, b, c;
    
    bool operator< (const Edges &w) const{
        return c < w.c;
    }
}edges[M];

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

int main(){
    cin >> n >> m;
    
    for (int i = 1; i <= n; i ++ ) f[i] = i;
    
    for (int i = 0; i < m; i ++ ){
        int a, b, c; cin >> a >> b >> c;
        edges[i] = {a, b, c};
    }
    
    sort (edges, edges + m);
    
    int res = 0, cnt = 0;
    for (int i = 0; i < m; i ++ ){
        int a = edges[i].a , b = edges[i].b, c = edges[i].c;
        
        a = find(a), b = find(b);
        if (a != b){
            f[a] = b;
            res += c;
            cnt ++;
        }
    }
    
    if (cnt  < n - 1) puts("orz");
    else cout << res << endl;
    
    return 0;
}