Add a bunch more stuff

Codeforces Round 1084 (Div. 3)/F. Mooclear Reactor 2.cpp

@@ -0,0 +1,148 @@
+/* Problem URL: https://codeforces.com/contest/2200/problem/F */
+
+#include <bits/stdc++.h>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+
+using namespace std;
+using namespace __gnu_pbds;
+
+template <class T, class comp = less<>>
+using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+const int oo = INT32_MAX >> 1;
+const ll OO = INT64_MAX >> 1;
+
+
+void pre()
+{
+
+}
+
+#define TEST 1
+
+void solve()
+{
+    int n, m;
+    cin >> n >> m;
+
+    vvi par(n + 1);
+    rep(i, n) {
+        int x, y;
+        cin >> x >> y;
+        par[y].push_back(x);
+    }
+
+    ll ans = 0;
+
+    vvl b(n + 1, vl(2));
+    multiset<ll> s;
+    ll tot = 0;
+    for (int i = n; i >= 0; i--) {
+        repv(j, par[i]) {
+            s.insert(j);
+            tot += j;
+        }
+
+        while (s.size() > i + 1) {
+            tot -= *s.begin();
+            s.erase(s.begin());
+        }
+
+        b[i][0] = tot;
+        b[i][1] = tot - *s.begin() * (s.size() == i + 1);
+        rmax(ans, b[i][0]);
+    }
+
+    vl ma(n + 1);
+    ma[0] = 0;
+    nrep(i, 1, n + 1) {
+        ma[i] = max(ma[i - 1], b[i][1]);
+    }
+
+    while (m--) {
+        ll x, y;
+        cin >> x >> y;
+        cout << max({b[y][0], ma[y] + x, ans}) << " \n"[m == 0];
+
+    }
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    pre();
+
+    int t;
+    (TEST && cin >> t) || (t = 1);
+    while (t--) {
+        solve();
+    }
+}