44pts求调

#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int N = 2e5 + 5;
int f[5005];
int n, m;
struct node{int x, y; ll z;} a[N]; 

bool cmp(node x, node y);
int find(int k);
void func();

int main() { 
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		cin >> a[i].x >> a[i].y >> a[i].z;
	}
	for (int i = 1; i <= n; i++) {
		f[i] = i;
	}
	func();
	return 0;
}

bool cmp(node x, node y) {
	return x.z < y.z;
}

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

void func() {
	sort(a + 1, a + m + 1, cmp);
	ll ans = 0;
	int cnt = 0;
	for (int i = 1; i <= m; i++) {
		if (find(a[i].x) == find(a[i].y)) {
			continue;
		}
		ans += a[i].z;
		f[a[i].y] = a[i].x;
		if (++cnt == n - 1) {
			cout << ans;
			return;
		}
	}
	cout << "orz";
	return;																																											
}