最小生成树kruskal

Kruskal：
Kruskal算法的思想比Prim好理解一些。先把边按照权值进行排序，用贪心的思想优先选取权值较小的边，并依次连接，若出现环则跳过此边（用并查集来判断是否存在环）继续搜，直到已经使用的边的数量比总点数少一即可。

洛谷p3366

#pragma GCC optimize(2)
#include<cstdio>
#include<cstring>
#include<queue>
#include<bitset>
#include<cmath>
#include<iostream>
#include<algorithm>
#define _rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for(int i = (a); i >= (b); --i)
#define _for(i, a, b) for(int i = (a); i <(b); ++i)
#define _rof(i, a, b) for(int i = (a); i >(b); --i)
#define oo INT_MAX
#define maxn 5050
#define maxm 500055
using namespace std;
typedef long long ll;
int cnt, n, roads, parent[maxn], out;
struct edge
{
 int to, from, cost;
 edge(int a, int b, int c) :from(a), to(b), cost(c) {}
 bool operator<(const edge& a)const {//权值升序
  return this->cost > a.cost;
 }
};
priority_queue<edge> q;//堆优化
int find(int a) {//查
 return a == parent[a] ? a : parent[a] = find(parent[a]);
}
void merge(int a, int b) {//并
 parent[find(a)] = find(b);
}
int main() {
 cin >> n >> roads;
 _rep(i, 1, n)parent[i] = i;
 for (int i = 0; i < roads; i++) {
  int a, b, c; cin >> a >> b >> c;
  q.push(edge(a, b, c)), q.push(edge(b, a, c));//无向图
 }
 while (!q.empty())
 {
  edge a = q.top(); q.pop();
  if (find(a.from) != find(a.to)) {
   merge(a.from, a.to);
   out += a.cost;
  }
 }
 for (int i = 1; i <= n; i++) {
  if (i == parent[i]) {
   cnt++;
  }
  if (cnt >= 2) {
   break;
  }
 }
 if (cnt >= 2) {
  cout << "orz";
 }
 else
 {
  cout << out;
 }
}