Add a bunch of other problems.

Some are not finished...

Codeforces Round 905 (Div. 3)/G1. Dances (Easy version).cpp

@@ -0,0 +1,121 @@
+/* Problem URL: https://codeforces.com/contest/1883/problem/G1 */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (size_t 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;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        int n, m;
+        cin >> n >> m;
+
+        multiset<ll> a;
+        multiset<ll> b;
+
+        a.insert(1);
+        nrep(i, 1, n) {
+            ll num;
+            cin >> num;
+            a.insert(num);
+        }
+
+
+        rep(i, n) {
+            ll num;
+            cin >> num;
+            b.insert(num);
+        }
+
+        auto itr = prev(a.end());
+        while (itr != a.begin()) {
+            auto now = b.upper_bound(*itr);
+            if (now != b.end()) {
+                auto aux = itr;
+                itr--;
+                b.erase(now);
+                a.erase(aux);
+            } else {
+                itr--;
+            }
+        }
+
+        auto now = b.upper_bound(*itr);
+        if (now != b.end()) {
+            b.erase(now);
+            a.erase(itr);
+        }
+
+        cout << b.size() << '\n';
+    }
+}