Add a lot more of my solutions.

I don't remember which ones doesn't pass though

CSES Problem Set/Room Allocation.cpp

@@ -0,0 +1,126 @@
+/* Problem URL: https://cses.fi/problemset/task/1164 */
+
+#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 n;
+    cin >> n;
+
+    V<tuple<int, ll, ll>> cus(n);
+    map<ll, int> var;
+    size_t ind = 0;
+    for (auto &[i, a, b] : cus) {
+        cin >> a >> b;
+        var[a] = 0;
+        var[b] = 0;
+        i = ind;
+        ind++;
+    }
+
+    int v = 0;
+    for (auto &i : var) {
+        i.second = v;
+        v++;
+    }
+
+    V<tuple<ll, int, int>> act;
+
+    for (auto &[i, a, b] : cus) {
+        a = var[a];
+        b = var[b];
+        act.emplace_back(a, 0, i);
+        act.emplace_back(b, 1, i);
+    }
+
+    int k = 1;
+    priority_queue<int, vi, greater<>> pos;
+    for (size_t i = 1; i <= n; i++) {
+        pos.push(i);
+    }
+    vi ans(n);
+
+    sortv(act);
+
+    for (auto [a, yes, i] : act) {
+        if (!yes) {
+            ans[i] = pos.top();
+            pos.pop();
+            rmax(k, ans[i]);
+        } else {
+            pos.push(ans[i]);
+        }
+    }
+
+    cout << k << '\n';
+    cout << ans;
+}