百练习+最大生成树，在其中找到最小的边，1，N链接即可

点击打开链接

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<cstring>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#define LL long long
#define inf 0x3f3f3f3f
#define mod 1e9+7
using namespace std;
int T=0,n=0,m=0,p[1005];
const int maxn=8e5+5;
struct Node{
    int left,right,weight;
}Q[maxn];
int find(int x){ return p[x]==x? x:p[x]=find(p[x]);}
bool cmp(Node x, Node y)
{
    return x.weight>y.weight;
}
int Kruskal()
{
    int ans=inf,left_x=0,right_y=0;
    sort(Q, Q+m, cmp);
    for(int i=0;i<m;i++){
        left_x =find(Q[i].left); right_y=find(Q[i].right);
        if(left_x!=right_y){
            ans=min(ans,Q[i].weight);
            p[left_x] = right_y;
        }
        if(find(1)==find(n)) break;
    }
    return ans;
}
void init()
{
    for(int i=0;i<=n;i++) p[i]=i;
}
int main()
{
    int a,b,weight,num=0;
    scanf("%d",&T);
    while (T--) {
        scanf("%d %d",&n, &m);
        init();
        for(int i=0;i<m;i++){
            scanf("%d %d %d",&a,&b,&weight);
            Q[i].left=a; Q[i].right=b; Q[i].weight=weight;
        }
        printf("Scenario #%d:\n",++num);
        printf("%d\n\n",Kruskal());
    }
    return 0;
}