在艾泽拉斯大陆上有一位名叫歪嘴哦的神奇术士，他是部落的中坚力量有一天他醒来后发现自己居然到了联盟的主城暴风城在被众多联盟的士兵攻击后，他决定逃回自己的家乡奥格瑞玛

题目背景

输入样例#1：
4 4 8
8
5
6
10
2 1 2
2 4 1
1 3 4
3 4 3
输出样例#1：
10

输入输出样例

 1 //通往奥格瑞玛的道路
 2 #include<iostream>
 3 #include<cstdio>
 4 #include<cstring>
 5 using namespace std;
 6
 7 const int MAXN = 10000 + 1;
 8 const int MAXM = 50000 + 1;
 9 const int INF = 0x3f3f3f3f;
10
11 int n, m, blood;
12 int city[MAXN];
13
14 int edge_num, head[MAXN];
15 struct edge {
16     int len, to, next;
17 }h[MAXM * 2];
18
19 inline void Add(int from, int to, int len) {
20     h[++edge_num].next = head[from];
21     h[edge_num].to = to, h[edge_num].len = len;
22     head[from] = edge_num;
23 }
24
25 inline int read() {
26     int x = 0; char ch = getchar();
27     while(ch < '0' || ch > '9') ch = getchar();
28     while(ch >= '0' && ch <= '9')
29         x = (x << 3) + (x << 1) + ch - 48, ch = getchar();
30     return x;
31 }
32
33 int fro, rear;
34 int dis[MAXN], que[MAXN * 20];
35 bool in_que[MAXN];
36 void SPFA(int money) {
37     for(int i = 0; i <= n; i++) dis[i] = INF;
38     memset(in_que, 0, sizeof(in_que));
39     in_que[1] = 1, dis[1] = 0;
40     que[fro = rear = 1] = 1;
41     while(fro <= rear) {
42         int x = que[fro++];
43         in_que[x] = 0;
44         for(int i = head[x]; i; i = h[i].next) {
45             int l = h[i].len, y = h[i].to;
46             if(dis[x] + l < dis[y] && city[y] <= money) {
47                 dis[y] = dis[x] + l;
48                 if(!in_que[y]) in_que[y] = 1, que[++rear] =y;
49             }
50         }
51     }
52 }
53
54 inline bool check(int money) {
55     SPFA(money);
56     return dis[n] < blood;
57 }
58 int main() {
59     int l = 0, r = 0;
60     n = read(), m = read(), blood = read();
61     for(int i = 1; i <= n; ++i) {
62         city[i] = read();
63         r = max(r, city[i]);
64     }
65     l = max(city[1], city[n]);
66     for(int i = 1; i <= m; ++i) {
67         int a, b, c;
68         a = read(), b = read(), c = read();
69         if(a != b) {
70             Add(a, b, c);
71             Add(b, a, c);
72         }
73     }
74     if(!check(r)) { puts("AFK"); return 0; }
75     while(l <= r) {
76         int mid = (l + r) >> 1;
77         if(!check(mid)) l = mid + 1;
78         else r = mid - 1;
79     }
80     printf("%d\n", l);
81 }