POJ 2395 Out of Hay(最小生成树)

挑战的专题最后一题..
不知为什么,感觉现在做挑战的练习题跟以前感觉不一样,以前感觉每一题都特别难,现在感觉毫无压力,可能只是这里的特殊情况吧,模版题居多.

/*  xzppp  */
#include <iostream>
#include <vector>
#include <cstdio>
#include <string.h>
#include <algorithm>
#include <queue>
#include <map>
#include <string>
#include <cmath>
#include <set>
#include <iomanip>
using namespace std;
#define FFF freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define MP make_pair
#define PB push_back
typedef long long  LL;
typedef unsigned long long ULL;
typedef pair<int,int > pii;
typedef pair<double,double > pdd;
typedef pair<double,int > pdi;
const int MAXN = 1e4+17;
const int MAXM = 20;
const int MAXV = 2*1e3+17;
const int INF = 0x7fffffff;
const int MOD = 1e9+7;
vector<pii > G[MAXV];
bool vis[MAXV];
int minc[MAXV];
int prim()
{
    for (int i = 0; i < MAXV; ++i)
    {
        minc[i] = INF;
        vis[i] = 0;
    }
    int res = 0;
    priority_queue<pii,vector<pii> ,greater<pii> > q;
    q.push(MP(0,0));
    while(!q.empty())
    {
        int v = q.top().second;
        int temp = q.top().first;
        q.pop();
        if(vis[v]) continue;
        //cout<<v<<endl;
        vis[v] = 1;
        res = max(res,temp);
        //cout<<res<<endl;
        for (int i = 0; i < G[v].size(); ++i)
        {
            //cout<<"in"<<endl;
            int d = G[v][i].first,to = G[v][i].second;
            if(!vis[to]&&minc[to]>d)
            {
                q.push(MP(d,to));
                minc[to] = d;
            }
        }
    }
    return  res;
}
int main()
{
    #ifndef ONLINE_JUDGE 
    FFF
    #endif
    int n,m;
    cin>>n>>m;
    for (int i = 0; i < m; ++i)
    {
        int u,v,c;
        scanf("%d%d%d",&u,&v,&c);
        u--;v--;
        G[u].push_back(MP(c,v));
        G[v].push_back(MP(c,u));
    }
    cout<<prim()<<endl;
    return 0;
}