#include <bits/stdc++.h> using namespace std; #define int long long const int inf = 1E18; struct modify_online_subset_minimum{ vector<int> a, ans; int l, r; priority_queue<array<int, 4>, vector<array<int, 4>>, greater<array<int, 4>>> pq; modify_online_subset_minimum(vector<int> a_, int l_, int r_) : l(l_), r(r_){ a = a_; sort(a.begin(), a.end()); if(l == 0) pq.push({0, -1, -1, -1}); int val = 0; for(int i = 0; i < a.size(); i++){ val += a[i]; if(i + 1 >= l && i + 1 <= r) pq.push({val, i, i, a.size()}); } } int operator[](int i){ while(i >= ans.size()){ if(pq.empty()) break; auto [v, c, i, h] = pq.top(); pq.pop(); ans.push_back(v); if(c == -1) continue; if(i + 1 < h) pq.push({v - a[i] + a[i + 1], c, i + 1, h}); if(c > 0 && c < i) pq.push({v - a[c - 1] + a[c], c - 1, c, i}); } return i < ans.size() ? ans[i] : inf; } }; void solve() { int n, m, k; cin >> n >> m >> k; vector<vector<int>> a(m); for(int i = 0; i < n; i++){ int u, t; cin >> t >> u; a[t - 1].push_back(u); } vector<modify_online_subset_minimum> all; for(int i = 0; i < m; i++){ int l, r; cin >> l >> r; all.push_back(modify_online_subset_minimum(a[i], l, r)); } sort(all.begin(), all.end(), [&](auto& u, auto& v){ return u[1] - u[0] < v[1] - v[0]; }); priority_queue<array<int, 3>, vector<array<int, 3>>, greater<array<int, 3>>> pq; int val = 0; for(int i = 0; i < m; i++){ val += all[i][0]; if(all[i][0] == inf){ while(k--) cout << -1 << '\n'; return; } } pq.push({val, -1, 0}); while(k--){ if(pq.empty() || pq.top()[0] >= inf){ cout << "-1\n"; continue; } auto [v, i, p] = pq.top(); pq.pop(); cout << v << '\n'; if(i != -1) pq.push({v + all[i][p + 1] - all[i][p], i, p + 1}); if(i + 1 < m) pq.push({v + all[i + 1][1] - all[i + 1][0], i + 1, 1}); if(p == 1 && i + 1 < m) pq.push({v + all[i + 1][1] - all[i + 1][0] + all[i][0] - all[i][1], i + 1, 1}); } } signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); solve(); }

Main.cpp: In constructor 'modify_online_subset_minimum::modify_online_subset_minimum(std::vector<long long int>, long long int, long long int)':
Main.cpp:20:68: warning: narrowing conversion of '((modify_online_subset_minimum*)this)->modify_online_subset_minimum::a.std::vector<long long int>::size()' from 'std::vector<long long int>::size_type' {aka 'long unsigned int'} to 'long long int' [-Wnarrowing]
   20 |             if(i + 1 >= l && i + 1 <= r) pq.push({val, i, i, a.size()});
      |                                                              ~~~~~~^~