Dijkstra堆优化版模板

#include<bits/stdc++.h>
using namespace std;
const int N=40;
int mp[N][N];
int dist[N],st[N];
int n,k;
typedef pair<int,int> PII;
void dijkstra(int kk)
{
    memset(dist,0x3f,sizeof(dist));
    priority_queue<PII,vector<PII>,greater<PII> > q;
    q.push(make_pair(0,kk));
    dist[kk]=0;
    while(!q.empty())
    {
        PII t=q.top();
        q.pop();
        if(st[t.second])continue;
        st[t.second]=1;
        
        for(int i=1;i<=n;i++)
        {
            if(i==t.second)continue;
            if(mp[t.second][i])
                if(dist[i]>dist[t.second]+mp[t.second][i])
                {
                    dist[i]=dist[t.second]+mp[t.second][i];
                    q.push(make_pair(dist[i],i));
                }
        }
    }
}

int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            cin>>mp[i][j];
    cin>>k;
    dijkstra(k);
    for(int i=1;i<=n;i++)
        if(i!=k)
            cout<<dist[i]<<' ';
    return 0;
}