为什么dij的优先队列用cmp会wa？

struct node
{
    int u,d;
    bool operator<(const node& rhs)
    const
    {
        return d>rhs.d;
    }
};
void Dijkstra()
{
    priority_queue<node> q;
    for(int i=1;i<=n;++i) d[i]=2147483647;
    q.push((node){s,d[s]});
    d[s]=0;
    while(!q.empty())
    {
        node x=q.top();
        int u=x.u;
        q.pop();
        if(vis[u]) continue;
        vis[u]=1;
        for(int i=head[u];i;i=e[i].next)
        {
            int v=e[i].v,w=e[i].w;
            if(d[u]+w<d[v])
            {
                d[v]=d[u]+w;
                q.push((node){v,d[v]});
            }
        }
    }
}

struct cmp{
    bool operator()(int x,int y){
        return dis[x]>dis[y];
    }
};
priority_queue<int,vector<int>,cmp>q;
void dijkstra(){
    int u,v,w;
    dis[s]=0;q.push(s);
    while(!q.empty()){
        u=q.top();
        q.pop();
        if(vis[u]) continue;
        vis[u]=true;
        for(int i=head[u];i;i=p[i].nxt){
            v=p[i].to;w=p[i].w;
            if(dis[u]+w<dis[v])
            {
                dis[v]=dis[u]+w;
                q.push(v);
            }
        }					
    }	
}