我知道不该怀疑一个两千人通过的题目。。。

但第八个点我下了数据输出是对的，可评测机提示我输出的是AFK。 我的代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
#define re register
using namespace std;
struct node{
    int next,to,z;
}w[100001];
ll f[10001],b,g[10001];
ll n,m,heap[10001],head,tail,team[10001];
ll o[10001],s[10001],z,x,y,l,r,mid,flag;
inline ll read(){
    int x=0,p=1; char ch=getchar();
    while (ch<'0'||ch>'9') {if (ch == '-') p=-1; ch=getchar();}
    while (ch>='0'&&ch<='9') {x=(x<<1)+(x<<3)+ch-'0'; ch=getchar();}
    return x*p;
}
bool spfa(ll c){
    if (g[1]>c||g[n]>c) return false;
    memset(o,0,sizeof(o));
    memset(s,30,sizeof(s));
    head=0; tail=1; team[head]=1;
    s[1]=0; o[1]=1;
    while (head<tail){
        int k=team[head];
        for (re ll i=heap[k]; i; i=w[i].next){
            if (s[w[i].to]>s[k]+w[i].z){
                s[w[i].to]=s[k]+w[i].z;
                if (!o[w[i].to]&&g[w[i].to]<=c&&s[w[i].to]<b){
                    o[w[i].to]=1;
                    team[tail]=w[i].to; tail++;
                }
            }
        }
        if (s[n]<b) return true;
        head++; o[k]=0;
    }
    return s[n]<b;
}
int main(){
    n=read(); m=read(); b=read();
    for (re ll i=1; i<=n; i++){
        f[i]=read(); g[i]=f[i];
    }
    for (re ll i=1; i<=m; i++){
        x=read(); y=read(); z=read();
        w[i].to=y; w[i].next=heap[x];
        w[i].z=z; heap[x]=i;
        w[i+m].to=x; w[i+m].next=heap[y];
        w[i+m].z=z; heap[y]=i+m;
    }
    sort(f+1,f+n+1);
    l=1; r=n;
    while (l<=r){
        mid=(l+r)/2;
        if (spfa(f[mid])){
            r=mid-1;
            flag=1;
        }
        else l=mid+1;
    }
    if (flag) printf("%lld",f[l]);
    else printf("AFK");
    return 0;
} 

输出应该是747332764