CSES - Flight Routes

Time Complexity: $\mathcal{O}(mk\log (mk))$

Maintain a priority queue of the $k$ best distances found for each vertex. We'll iterate through the adjacency list of each vertex at most $k$ times.

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

using ll = long long;
using ld = long double;
using db = double;
using str = string; // yay python!

using pi = pair<int,int>;
using pl = pair<ll,ll>;