迪杰斯特拉 堆优化

/********
Author Smile
https://vjudge.csgrandeur.cn/contest/478006#problem/A
********/
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <map>
#include <vector>
#include <set>
#include <stack>
#define mk make_pair<int, int>
using namespace std;
typedef pair<int, int> PII;
const int N = 1e4 + 10; // 注意双向性 
const int inf = 0x3f3f3f3f;
struct node
{
	int y, z, pre;
}edge[N];
int m, n, tot, head[N], dist[N];
int vis[N];

void addedge(int x, int y, int z)
{
	edge[++tot].y = y, edge[tot].z = z, edge[tot].pre = head[x], head[x] = tot; 
}

void Dijstra()
{
	memset(dist, inf, sizeof dist);
	priority_queue<PII, vector<PII>, greater<PII> > heap;
	dist[1] = 0;
	heap.push(mk(0, 1));
	while (!heap.empty())
	{
		PII tmp = heap.top();
		heap.pop();
		int b = tmp.second, distance = tmp.first;
		if (vis[b])
			continue;
		vis[b] = 1;
		for (int i = head[b]; i != -1; i = edge[i].pre)
		{
			int j = edge[i].y;
			if (!vis[j] && dist[j] > distance + edge[i].z)
			{
				dist[j] = distance + edge[i].z;
				heap.push(mk(dist[j], j));
			}
		}	
	}
	cout << dist[n] << endl;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	memset(head, -1, sizeof head);
	cin >> m >> n;
	for (int i = 1; i <= m; ++i)
	{
		int x, y, z;
		cin >> x >> y >> z;
		addedge(x, y, z);
		addedge(y, x, z);
	}
	Dijstra();
}