Dikstra 堆优化板子

#include <bits/stdc++.h>
#define MAXN 10005
using namespace std;
typedef long long LL;
vector<pair<int,LL>> edges[MAXN];
const LL oo=1e18;
int n,m;
LL d[MAXN];
void init(){
    for(int i=;i<MAXN;i++)edges[i].clear();
    for(int i=;i<MAXN;i++)d[i]=oo;
}
int main(){
    freopen("test1.in","r",stdin);
    std::ios::sync_with_stdio();
    std::cin.tie();
    int cases;
    scanf("%d",&cases);
    while(cases--){
        init();
        scanf("%d%d",&n,&m);
        while(m--){
            int x,y;
            LL z;
            scanf("%d%d%lld",&x,&y,&z);
            edges[x].push_back(make_pair(y,z));
        }
        priority_queue<pair<int,int>> que;
        d[]=;
        que.push(make_pair(-d[],));
        while(!que.empty()){
            int now = que.top().second;
            que.pop();
            for(int i=;i<edges[now].size();i++){
                int v = edges[now][i].first;
                if(d[v]>d[now]+edges[now][i].second){
                    d[v] = d[now]+edges[now][i].second;
                    que.push(make_pair(-d[v],v));
                }
            }
        }
        printf("%lld\n",d[n]);
    }
    return ;
}