priority_queue优化Dijkstra最短路径算法

#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define fio ios::sync_with_stdio(false);cin.tie(0);
#define pii pair<int,int>
#define vi vector<int>
#define vc vector<char>
#define mii map<int,int>
#define si(a) scanf("%d",&a)
#define ss(a) scanf("%s",&a)
#define sl(a) scanf("%I64d",&a);
#define slf(a) scanf("%lf",&a);
#define CLEAR(a,b) memset(a,b,sizeof(a))
#define pi acos(-1)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
const int INF=0x3f3f3f3f;
const int N=2e5+5;
using namespace std;

priority_queue< int,vector<int>,greater<int> > pqg;
priority_queue< int,vector<int>,less<int> > pql;


struct edge
{
    int to,cost;
};
//first是最短距离，second是顶点的编号
int v;//顶点个数
vector<edge> G[N];
int dis[N];
priority_queue<pii,vector<pii>,greater<pii> > que;

void dijkstra(int start)
{
    memset(dis,INF,sizeof dis);
    dis[start] = 0;
    que.push(make_pair(0,start)); //把起点推入队列
    while(!que.empty())
    {
        pii p = que.top(); que.pop();
        int v = p.second; //顶点的编号
        if (dis[v] < p.first) continue;
        for(int i = 0; i < G[v].size(); i++)
        {
            edge e = G[v][i];
            if (dis[e.to] > dis[v] + e.cost)
            {
                dis[e.to] = dis[v] + e.cost;
                que.push(make_pair(dis[e.to],e.to));
            }
        }
    }
}

int main()
{
    
}