Add some more problems and update TODO list

Codeforces Round 907 (Div. 2)/C. Smilo and Monsters.cpp

@@ -0,0 +1,166 @@
+/* Problem URL: https://codeforces.com/problemset/problem/1891/C */
+
+#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;
+    cin >> n;
+
+    vl a(n);
+    cin >> a;
+    sortv(a);
+
+    ll x = 0;
+
+    int i = 0;
+    int j = n - 1;
+    ll ans = 0;
+
+    while (i < j) {
+        if (x + a[i] >= a[j]) {
+            ll diff = a[j] - x;
+            a[i] -= diff;
+            a[j] = 0;
+            ans += diff + 1;
+            j--;
+            i += a[i] == 0;
+            x = 0;
+            continue;
+        }
+
+        ans += a[i];
+        x += a[i];
+        a[i] = 0;
+        i++;
+
+        if (x >= a[j]) {
+            ans++;
+            x -= a[j];
+            a[j] = 0;
+            j--;
+        }
+    }
+
+    if (i > j) {
+        cout << ans << '\n';
+        return;
+    }
+
+    ll low = 0;
+    ll high = 1e9;
+    ll act = 0;
+    while (low <= high) {
+        ll mid = (low + high) >> 1;
+
+        if (x + (mid << 1) <= a[i]) {
+            act = mid;
+            low = mid + 1;
+            continue;
+        }
+
+        high = mid - 1;
+    }
+
+    ans += min(a[i], max(a[i] - (act << 1) - x + 1 + act, 0LL));
+
+    cout << ans << '\n';
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    pre();
+
+    int t;
+    (TEST && cin >> t) || (t = 1);
+    while (t--) {
+        solve();
+    }
+}