Pagini recente » Cod sursa (job #541166) | Cod sursa (job #704801) | Cod sursa (job #704810) | Cod sursa (job #1614298) | Cod sursa (job #3214031)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("apm.in");
ofstream fout("apm.out");
///platou2
struct Patru
{
int x, y, c, v;
bool operator<(const Patru e) const
{
return c < e.c;
}
} a[400005];
int t[200005], n, m;
int Find(int x)
{
int rad, y;
rad = x;
while(t[rad] != 0)
rad = t[rad];
while(x != rad)
{
y = t[x];
t[x] = rad;
x = y;
}
return rad;
}
void Union(int x, int y)
{
t[y] = x;
}
int main()
{
ios_base::sync_with_stdio(0);
fin.tie(0);
fout.tie(0);
int i, x, y;
fin >> n >> m;
for(i=1; i<=m; i++)
{
fin >> a[i].x >> a[i].y >> a[i].c;
a[i].v = 0;
}
sort(a + 1, a + m + 1);
int nrc = n;
int sum = 0;
for(i=1;i<=m && nrc > 1;i++)
{
x = Find(a[i].x);
y = Find(a[i].y);
if(x != y)
{
Union(x, y);
sum += a[i].c;
a[i].v = 1;
nrc--;
}
}
fout << sum << "\n" << n - 1 << "\n";
for(i=1;i<=m;i++)
if(a[i].v == 1) fout << a[i].x << " " << a[i].y << "\n";
fin.close();
fout.close();
return 0;
}