有不有大佬可以帮帮我康康为什么会出现这玩意儿QWQ

C:\Users\Administrator\Desktop\未命名3.cpp In function 'void dij()': 17 12 C:\Users\Administrator\Desktop\未命名3.cpp [Warning] extended initializer lists only available with -std=c++11 or -std=gnu++11 17 17 C:\Users\Administrator\Desktop\未命名3.cpp [Warning] extended initializer lists only available with -std=c++11 or -std=gnu++11 27 16 C:\Users\Administrator\Desktop\未命名3.cpp [Warning] extended initializer lists only available with -std=c++11 or -std=gnu++11 27 26 C:\Users\Administrator\Desktop\未命名3.cpp [Warning] extended initializer lists only available with -std=c++11 or -std=gnu++11

#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> PII;
const int N=100010,M =N*2;
int h[N],to[M],nxt[M],w[M];
int dis[N];
bool vis[N];
int n,m,s,idx;
inline void add(int u,int v,int c){
    nxt[idx] = h[u],to[idx] = v,w[idx] = c,h[u] = idx++;
}
inline void dij(){
    memset(dis,0x3f,sizeof dis);
    dis[s] = 0;
    priority_queue<PII,vector<PII>,greater<PII> > head;
    head.push({0,s});
    while(head.size()){
        int t = head.top().second;
        head.pop();
            if(vis[t]) continue;
            vis[t] = true;
            for(int i=h[t];~i;i=nxt[i]){
                int j=to[i];
                if(dis[j]>dis[t]+w[i]){
                    dis[j] = dis[t] + w[i];
                    head.push({dis[j],j});
                }
            }   
    }
}
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    memset(h,-1,sizeof h);
    cin >> n >> m >> s;
    for(int i=1;i<=m;i++){
        int a,b,c;
        cin >> a >> b >> c;
        add(a,b,c);
    }
    dij();
    for(int i=1;i<=n;i++) cout << dis[i] << " ";
    return 0;
}