题目:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=18265
代码:
#include<stdio.h>
#include<queue>
#include<vector>
using namespace std;
const int maxn=2005;
vector<pair<int,int> >E[maxn];
int d[maxn];
int n,m;
void init()
{
for(int i=0;i<maxn;i++)E[i].clear();
for(int i=0;i<maxn;i++)d[i]=1e9;
}
int main()
{
init();
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)
{
int x,y,z;scanf("%d%d%d",&x,&y,&z);
E[x].push_back(make_pair(y,z));
E[y].push_back(make_pair(x,z));
}
priority_queue<pair<int,int> >Q;
Q.push(make_pair(-d[1],1));
d[1]=0;
while(!Q.empty())
{
int now=Q.top().second;
Q.pop();
for(int i=0;i<E[now].size();i++)
{
int v=E[now][i].first;
if(d[v]>d[now]+E[now][i].second)
{
d[v]=d[now]+E[now][i].second;
Q.push(make_pair(-d[v],v));
}
}
}
printf("%d\n",d[m]);
}