Compilare: main.cpp: In constructor 'Graph::Graph(int, int, std::vector<std::vector<std::pair<int, int> > >, int, std::vector<int>, std::priority_queue<std::pair<int, int> >, std::vector<int>)': main.cpp:13:36: warning: 'Graph::adj_list' will be initialized after [-Wreorder] 13 | vector<vector<pair<int, int>>> adj_list; | ^~~~~~~~ main.cpp:12:15: warning: 'int Graph::K' [-Wreorder] 12 | int N, M, K; | ^ main.cpp:19:5: warning: when initialized here [-Wreorder] 19 | Graph(int _N, int _M, vector<vector<pair<int, int>>> _adj_list, int _K, vector<int> _catun, priority_queue<pair<int, int>> _heap, vector<int> _dist) : N(_N), M(_M), adj_list(std::move(_adj_list)), K(_K), catun(_catun), heap(_heap), dist(_dist) { | ^~~~~ main.cpp:15:36: warning: 'Graph::heap' will be initialized after [-Wreorder] 15 | priority_queue<pair<int, int>> heap; | ^~~~ main.cpp:14:24: warning: 'std::vector<int> Graph::dist' [-Wreorder] 14 | vector<int> catun, dist; | ^~~~ main.cpp:19:5: warning: when initialized here [-Wreorder] 19 | Graph(int _N, int _M, vector<vector<pair<int, int>>> _adj_list, int _K, vector<int> _catun, priority_queue<pair<int, int>> _heap, vector<int> _dist) : N(_N), M(_M), adj_list(std::move(_adj_list)), K(_K), catun(_catun), heap(_heap), dist(_dist) { | ^~~~~