[백준 1916] 최소비용 구하기

#include<cstdio>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
 
const int INF = 0x3f3f3f3f;
 
using namespace std;
 
vector<vector<pair<int, int>>> map;
vector<bool> visit;
priority_queue<pair<int, int>> pq;
vector<int> money;
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
 
    cin >> n;
    map.resize(n + 1);
    visit.resize(n + 1);
    money.resize(n + 1);
 
    int m;
    cin >> m;
 
    int from, to, cost;
    int start, end;
 
    fill(money.begin(), money.end(), INF);
 
    for (int i = 0; i < m; i++)
    {
        cin >> from >> to >> cost;
        int vcheck = 0;
        for (; vcheck < map[from].size(); vcheck++)
        {
            if (map[from][vcheck].first == to && map[from][vcheck].second > cost)
            {
                map[from][vcheck].second = cost;
                break;
            }
        }
        if (vcheck == map[from].size())
        {
            map[from].push_back(make_pair(to, cost));
        }
    }
 
    cin >> start >> end;
 
    pq.push(make_pair(0, start));
    money[start] = 0;
 
    while (!pq.empty())
    {
        pair<int, int> now = pq.top(); pq.pop();
 
        for (int i = 0; i < map[now.second].size(); i++)
        {
            if (money[map[now.second][i].first] > money[now.second] + map[now.second][i].second)
            {
                money[map[now.second][i].first] = money[now.second] + map[now.second][i].second;
                pq.push(make_pair(-map[now.second][i].second, map[now.second][i].first));
            }
        }
    }
 
    printf("%d", money[end]);
    return 0;
}