1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int n, m, u, d[1002], s, e, c, b[1002];
int main() {
	cin >> n >> m;
	priority_queue<pair<int, int>> p;
	vector<vector<pair<int, int>>> a(n + 1);
	while (m--) {
		cin >> s >> e >> c;
		a[s].push_back({ e,c });
	}
	cin >> s >> e;
	fill(d, d + n + 1, 987654321);
	d[s] = 0;
	p.push({ 0, s });
	while (!p.empty()) {
		s = p.top().second;
		p.pop();
		if (b[s])	continue;
		b[s] = true;
		for (auto t : a[s]) {
			u = t.first, c = t.second;
			if (d[u] > d[s] + c) {
				d[u] = d[s] + c;
				p.push({ -d[u], u });
			}
		}
	}
	cout << d[e] << endl;
}