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.

1#include <bits/stdc++.h>
2using namespace std;
3 
4using ll = long long;
5using ld = long double;
6using db = double; 
7using str = string; // yay python!
8
9using pi = pair<int,int>;
10using pl = pair<ll,ll>;