k번째 최단경로

#include <iostream>
#include <vector>
#include <queue>
#include <functional>
#include <algorithm>
#include <cstring>
#include <set>
#define MAXX 1001
#define INF 987654321
using namespace std;
 
typedef pair<int, int> pp;
 
vector<pp> edges[MAXX];
 
priority_queue<int> cost[MAXX];
 
bool visited[MAXX];
int res[101][1001];
 
void dijkstra(int k) {
    priority_queue<pp, vector<pp>, greater<pp> > pq;
    pq.push(pp(0, 1));
 
    cost[1].push(0);
 
    while (!pq.empty()) {
        int now = pq.top().second;
        int c_cost = pq.top().first;
 
        pq.pop();
 
 
        for (auto i : edges[now]) {
            int n_cost = i.first;
            int next = i.second;
 
            if (cost[next].size() < k) {
                cost[next].push(n_cost + c_cost);
                pq.push(pp(n_cost + c_cost, next));
 
            }
            else {
                
                if (cost[next].top() > n_cost + c_cost) {
                    cost[next].pop();
                    cost[next].push(n_cost + c_cost);
                    pq.push(pp(n_cost + c_cost, next));
                }
            }
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
 
    int n, m, k;
    cin >> n >> m >> k;
 
    //for (int i = 1; i <= n; i++) cost[i] = INF;
 
    while (m--) {
        int a, b, c;
        cin >> a >> b >> c;
 
        edges[a].push_back(pp(c, b));
    }
 
    //각 도시별로 pq를 돌린다. 
    dijkstra(k);
 
    for (int i = 1; i <= n; i++) {
        if (cost[i].size() < k) cout << -1 << '\n';
        else {
        
            cout << cost[i].top() << '\n';
        }
        
    }
 
    return 0;
}