poj 1861 network

#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
#define MAX 15000
typedef struct
{
int first;
int second;
int cablelen;
bool choosed;
}connect;
connect connections[MAX+10];
int hubs[1010];

bool compare(connect a,connect b)
{
return a.cablelen<b.cablelen;
}
int find(int i)
{
for(;hubs[i]>=0;i=hubs[i])
{;}
return i;
}
void simpleUnion(int i,int j)
{
hubs[i]=j;
}
int main()
{
int N,M,i,count=0,count1=0,maxnum=0;
scanf("%d%d",&N,&M);
for(i=1;i<=N;i++)
hubs[i]=-1;
for(i=0;i<M;i++)
{
scanf("%d%d%d",&connections[i].first,&connections[i].second,&connections[i].cablelen);
connections[i].choosed=false;
}
sort(connections,connections+M,compare);    \\路径从小到大排序

while(count!=N-1)
{
while(count1<=M-1)
{
int a=find(connections[count1].first);
int b=find(connections[count1].second);
count1++;
if(a!=b)
{
simpleUnion(a,b);
count++;
connections[count1-1].choosed=true;
if(connections[count1-1].cablelen>maxnum)
maxnum=connections[count1-1].cablelen;
break;
}
}
}
printf("%d\n",maxnum);
printf("%d\n",N-1 );
for(i=0;i<M;i++)
if(connections[i].choosed)
printf("%d %d\n",connections[i].first,connections[i].second);

system("pause");
return 0;
}