Flight Routes

#include<bits/stdc++.h>
using namespace std;

#define   fi(a,b) for(int i=a;i<b;i++)
#define   fj(a,b) for(int j=a;j<b;j++)
#define   ff first
#define   ss second
#define   ll long long
#define   ld long double
#define   ull unsigned long long
#define   bp(x) __builtin_popcount(x)
#define   pr(x) for(auto it: x) cout<<it<<" "; cout<<endl;
#define   getMax(x) max_element(x.begin(),x.end())
#define   getMin(x) min_element(x.begin(),x.end())
#define   endl "\n"
typedef   vector<int> vi;
typedef   vector< pair<int,int> > vii;
typedef   vector<long long> vl;
typedef   pair<int,int> pii;
typedef   pair<ll,ll> pll;
typedef   vector< pair<ll,ll> > vll;
//int dx[]={1,0,-1,0};
//int dy[]={0,1,0,-1};
//int dx[]={-1,0,1,1,1,0,-1,-1};
//int dy[]={-1,-1,-1,0,1,1,1,0};

vector<vll>adj;
vl ans;

void nikal_pehli_fursat_mai(){
    int n, m, k;
    cin>>n>>m>>k;
    adj.assign(n, vll({}));

    fi(0, m){
        int u, v, w;
        cin>>u>>v>>w;
        u--; v--;
        adj[u].push_back({v, w});
    }
    
    vi cnt(n, 0);
   
    priority_queue<pll, vll, greater<pll>>q;
    q.push({0, 0});
    
    while(!q.empty() and cnt[n-1]<k){
        auto u = q.top();
        q.pop();
        
        cnt[u.ss]++;
        
        if(u.ss==n-1) ans.push_back(u.ff);


        if(cnt[u.ss] <= k){
            for(auto it: adj[u.ss]){
                q.push({u.ff+it.ss, it.ff});
            }
        }
    }

    sort(ans.begin(), ans.end());
    fi(0, k) cout<<ans[i]<<" ";
}

int main(){
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    int tc=1; 
    // cin>>tc;
    while(tc--){
    nikal_pehli_fursat_mai();
    }
}