POJ 1861 最短路

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxm = 15010;
const int maxn = 1010;
int n, m, fa[maxn];
struct Edge
{
	int s, t, w;
	Edge(int a = 0, int b = 0, int c = 0): s(a), t(b), w(c) {}
	bool operator < (const Edge &other) const
	{
		return w < other.w;
	}
};
Edge edge[maxm];
int find(int x)
{
	return x == fa[x] ? x : find(fa[x]);
}
void kruscal()
{
	int cnt = 0, i;
	for (i = 0; i < m; i++)
	{
		int X = find(edge[i].s);
		int Y = find(edge[i].t);
		if (X != Y)
		{
			fa[X] = Y;
			cnt++;
		}
		if (cnt == n - 1) break;
	}
	printf("%d\n%d\n", edge[i].w, i + 1);
	for (int j = 0; j <= i; j++)
		printf("%d %d\n", edge[j].s, edge[j].t);
}
Edge read_edge()
{
	int a, b, c;
	scanf("%d%d%d", &a, &b, &c);
	return Edge(a, b, c);
}
int main(int argc, char const *argv[])
{
	while (~scanf("%d%d", &n, &m) && n + m)
	{
		for (int i = 0; i < n; i++) fa[i] = i;
		for (int i = 0; i < m; i++)
			edge[i] = read_edge();
		sort(edge, edge + m);
		kruscal();
	}
	return 0;
}

输出最小生成树最大的边，输出用到的电缆数量，剩下的就是输出每条电缆。