堆优化dij TLE?

难道只是因为我用了vector存边？？？ 不开O2 64 开O2就过了...迷

#include<bits/stdc++.h>
using namespace std;
#define P pair<ll,ll>
typedef long long ll;
const ll maxn=10010;
const ll INF=2147483647;
struct node
{
    ll to,val;
};
node cur;
P icur; 
priority_queue<P,vector<P>,greater<P> >q;
ll n,m,k,c[maxn],dis[maxn],x,y,p,l,r;
vector<node> e[maxn];
bool vis[maxn];
bool dijkstra(ll x)
{
    dis[1] = 0;
    q.push(make_pair(0,1));
    while(!q.empty())
    {
        icur = q.top();
        q.pop();
        if(!vis[icur.second])
        {
            vis[icur.second] = 1;
            for(int i = 0;i < e[icur.second].size();i++)
            {
                cur = e[icur.second][i];
                if(c[cur.to] > x)continue;
                dis[cur.to] = min(dis[cur.to],dis[icur.second] + cur.val);
                q.push(make_pair(dis[cur.to],cur.to));
            }
        }
    }
    if(dis[n] <= k)return true;
    return false;
}
int main()
{
    cin>>n>>m>>k;
    for(int i = 1;i <= n;i++)
    {
        cin>>c[i];
        r = max(r,c[i]);
    }
    l = max(c[1],c[n]) - 1;
    while(m--)
    {
        cin>>x>>y>>p;
        cur.val = p;
        cur.to = x;
        e[y].push_back(cur);
        cur.to = y;
        e[x].push_back(cur);
    }
    for(int i = 1;i <= n;i++)dis[i] = INF;
    if(!dijkstra(INF))
    {
        cout<<"AFK";
        return 0;
    }
    while(l < r - 1)
    {
        for(int i = 1;i <= n;i++)dis[i] = INF;
        memset(vis,0,sizeof(vis));
        ll mid = (l + r)>>1;
        if(dijkstra(mid))r = mid;
        else l = mid;
    }
    cout<<r;
    return 0;
}