Pagini recente » Cod sursa (job #2864883) | Cod sursa (job #27728) | Cod sursa (job #1895760) | Cod sursa (job #2901373) | Cod sursa (job #2027018)
#include <fstream>
using namespace std;
ifstream fin ("apm.in");
ofstream fout ("apm.out");
struct elem {
int x, y, cost;
} v[400001];
int n, m, T[100001];
int cpm (const elem a, const elem b) {
return a.cost >= b.cost;
}
int main () {
fin >> n >> m;
for (int i = 1; i <= m; i++) {
fin >> v[i].x >> v[i].y >> v[i].cost;
}
sort (v + 1, v + m + 1, cmp);
for (int i = 1; i <= n; i++) {
T[i] = -1;
}
for (int i = 1; i <= m; i++) {
int rx, int ry;
rx = rad (v[i].x);
ry = rad (v[i].y);
if (rx != ry) {
if (T[rx] < T[ry]) {
T[rx] += T[ry];
T[ry] = rx;
}
else {
T[ry] += T[rx];
T[rx] = ry;
}
}
}
return 0;
}