Dijkstra朴素＋堆优化

#include<iostream>
#include<cstring>
using namespace std;
const int N=510;
int n,m;
int dis[N];//距离 
bool st[N];
int g[N][N]; //邻接矩阵 
int Dijkstra(){
	memset(dis,0x3f,sizeof dis);
	dis[1]=0;
	for(int i=0;i<n;i++){
		//找到没有确定最短长度最近的点 
		int t=-1;
		for(int j=1;j<=n;j++){
			if(!st[j]&&(t==-1||dis[t]>dis[j]))
			{
				t=j;
			}
		}
		st[t]=true;//添加到已确定最短路的集合 
		 
		for(int j=1;j<=n;j++){//用t更新最短距离 
			if(dis[j]>dis[t]+g[t][j]){
				dis[j]=dis[t]+g[t][j];
			}
		}
	
	} 
	if(dis[n]==0x3f3f3f3f){
		return -1;
	}
	return  dis[n];
	
}
int main(){
	cin>>n>>m;
	memset(g,0x3f,sizeof g);
	while(m--){
		int a,b,c;
		cin>>a>>b>>c;
		g[a][b]=min(g[a][b],c);
	}
	
	int t=Dijkstra();
	cout<<t<<endl;
	return 0;
	
}

#include <iostream>
#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;
const int N = 100010;
int n, m;
int dis[N]; // 距离
bool st[N];
int e[N], ne[N], w[N], h[N], idx;

typedef pair<int, int> PII;
void add(int a, int b, int c)
{
    e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx++;
}

int Dijkstra()
{
    memset(dis, 0x3f, sizeof dis);
    priority_queue<PII, vector<PII>, greater<PII>> heap;
    heap.push({0, 1});

    dis[1] = 0;

    while (heap.size())
    {

        auto t = heap.top();
        heap.pop();
        int ver = t.second, distance = t.first;
        if (st[ver])
        {
            continue;
        }
        st[ver] = true;
        for (int i = h[ver]; i != -1; i = ne[i])
        {
            int j = e[i];
            if (dis[j] > distance + w[i])
            {
                dis[j] = distance + w[i];
                heap.push({dis[j], j});
            }
        }
    }

    if (dis[n] == 0x3f3f3f3f)
    {
        return -1;
    }
    return dis[n];
}
int main()
{
    cin >> n >> m;
    memset(h, -1, sizeof h);
    while (m--)
    {
        int a, b, c;
        cin >> a >> b >> c;
        add(a, b, c);
    }

    int t = Dijkstra();
    cout << t << endl;
    return 0;
}