最后一个点 T 了。。。

#include <bits/stdc++.h>
using namespace std;
const int N = 2e4 + 10;
int h[N], ne[N], e[N], w[N], idx;
int dist[N / 2];
bool vis[N / 2];
inline void add(int a, int b, int c) {
	e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx++;
}
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>> > q;
inline void dijkstra(int s) {
	q.push(make_pair(0, s));
	dist[s] = 0;
	while (!q.empty()) {
		pair<int, int> temp = q.top();
		q.pop();
		int ver = temp.second;
		if (vis[ver])
			continue;
		vis[ver] = 1;
		for (int i = h[ver]; i != -1; i = ne[i]) {
			int dis = w[i], u = e[i];
			if (dist[u] > max(dis, dist[ver])) {
				dist[u] = max(dis, dist[ver]);
				q.push({dist[u], u});
			}
		}
	}
}
signed main() {
	ios::sync_with_stdio(false);
	ios_base::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	memset(h, -1, sizeof h);
	int n, m, s, t;
	cin >> n >> m >> s >> t;
	for (int i = 1; i <= n; i++)
		dist[i] = 1e18;
	for (int i = 1; i <= m; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		add(u, v, w);
		add(v, u, w);
	}
	dijkstra(s);
	cout << dist[t];
	return 0;
}

我是吕布，你想成为董卓吗？