POJ 1861最小瓶颈树wa

说好的最小瓶颈树，要求最长边的最小值，过程中那些边可以重复？

样例Output什么鬼。。。怎么回事#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1000+10;
const int maxm=15000+10;

struct Edge
{
int u,v,dist;
Edge(){}
Edge(int u,int v,int d):u(u),v(v),dist(d){}
bool operator<(const Edge &rhs)const
{
return dist < rhs.dist;
}
};

struct Kruskal
{
int n,m;
Edge edges[maxm];
int fa[maxn];
int findset(int x){ return fa[x]==-1? x:fa[x]=findset(fa[x]); }

void init(int n)
{
this->n=n;
m=0;
memset(fa,-1,sizeof(fa));
}

void AddEdge(int u,int v,int dist)
{
edges[m++]=Edge(u,v,dist);
}

int kruskal()
{
int edge_max;
int sum=0;
int cnt=0;
sort(edges,edges+m);

for(int i=0;i<m;i++)
{
int u=edges[i].u, v=edges[i].v;
if(findset(u) != findset(v))
{
edge_max=edges[i].dist;
sum +=edges[i].dist;
fa[findset(u)] = findset(v);
if(++cnt>=n-1) break;
}
}
if(cnt<n-1) return -1;
return edge_max;
}
}KK;

int n,m;
int a[maxm],b[maxm];

int main()
{
int cnt=0;
scanf("%d%d",&n,&m);
int u,v,d;
KK.init(n);
for(int i=0;i<m;i++)){
scanf("%d%d%d",&u,&v,&d);
KK.AddEdge(u,v,d);
}
int edge_max=KK.kruskal();
for(int i=0;i<m;i++){
if(KK.edges[i].dist<=edge_max){
a[cnt]=KK.edges[i].u;
b[cnt++]=KK.edges[i].v;
}
}
printf("%d\n%d\n",edge_max,)

return 0;
}