P3366最小生成树Prim模板

#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int N = 1e4,inf = INT_MAX;
int n, m, s, a, b, c, ans, cnt;
struct edge { int v, w; };
vector<edge>e[N];
int d[N], vis[N];
priority_queue<pair<int, int>>q;
bool prim(int s){
	for (int i = 0; i <= n; ++i) d[i] = inf;
	d[s] = 0; q.push({ 0,s });
	while (!q.empty()) {
		int u = q.top().second; q.pop();
		if (vis[u]) continue;
		vis[u] = 1;
		ans += d[u]; cnt++;
		for (auto ed : e[u]) {
			int v = ed.v, w = ed.w;
			if (d[v] > w) {
				d[v] = w;
				q.push({ -d[v],v });
			}
		}
	}
	return cnt == n;
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	cin >> n >> m;
	for (int i = 0; i < m; ++i) {
		cin >> a >> b >> c;
		e[a].push_back({ b,c });
		e[b].push_back({ a,c });
	}
	if (prim(1)) cout << ans << endl;
	else cout << "orz" << endl;
	return 0;
}