luoguP1951 收费站_NOI导刊2009提高（2）

#include <bits/stdc++.h>
#define inf 2147483647
using namespace std;
int n, m, u, v, s, f[10005], e[10005], head[1000500], d[10005], ans, tot, l, r;
void input() {
    freopen("input.txt", "r", stdin);
    // freopen("output.txt","w",stdout);
}
struct A {
    int v, w, next;
} lu[1000500];
void add(int x, int y, int z) {
    lu[++tot].v = y;
    lu[tot].w = z;
    lu[tot].next = head[x];
    head[x] = tot;
}
void read() {
    int a, b, c;
    scanf("%d%d%d%d%d", &n, &m, &u, &v, &s);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &f[i]);
        e[i] = f[i];
    }
    sort(e + 1, e + n + 1);
    for (int i = 1; i <= m; i++) {
        scanf("%d%d%d", &a, &b, &c);
        add(a, b, c);
        add(b, a, c);
    }
}
deque<int> q;
bool spfa(long long minn) {
    for (int i = 0; i <= n; i++) d[i] = inf;
    q.push_back(u);
    d[u] = 0;
    while (q.size()) {
        int now = q.front();
        q.pop_front();
        if (f[now] > minn)
            continue;
        for (int i = head[now]; i; i = lu[i].next) {
            if (f[lu[i].v] > minn)
                continue;
            if (d[lu[i].v] > d[now] + lu[i].w) {
                d[lu[i].v] = d[now] + lu[i].w;
                if (q.size() && d[lu[i].v] < d[q.front()])
                    q.push_front(lu[i].v);
                else
                    q.push_back(lu[i].v);
            }
        }
    }
    return d[v] <= s;
}
void work() {
    int l = 1, r = n;
    while (l <= r) {
        int j = (l + r) >> 1;
        if (spfa(e[j])) {
            ans = e[j];
            r = j - 1;
        } else
            l = j + 1;
    }
    if (ans == 0)
        printf("-1
");
    else
        printf("%d
", ans);
}
int main() { 
 // input();
    read();
    work();
    return 0;
}