Start doing a new problem.

I had to leave while I was finishing this, I'll finish it
later.

2015/phase2/fila.cpp

@@ -0,0 +1,126 @@
+/* Problem URL: https://olimpiada.ic.unicamp.br/pratique/p2/2015/f2/fila/ */
+
+#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;
+}
+
+struct insertion {
+    int pos;
+    int ind;
+    int val;
+
+    insertion(int pos, int ind, int val): pos(pos),
+                                          ind(ind),
+                                          val(val) {}
+
+    bool operator<(insertion &i) {
+        if (ind == i.ind) {
+            return pos < i.pos;
+        }
+        return ind < i.ind;
+    }
+};
+
+struct query {
+    int type;
+    int pos;
+    ll val;
+
+    query(int type, int pos, int val): type(type),
+                                       pos(pos),
+                                       val(val) {}
+};
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int n;
+    cin >> n;
+    vl queue(n);
+    cin >> queue;
+
+    int q;
+    cin >> q;
+
+    V<query> queries(q);
+    V<insertion> inserts;
+
+    rep(i, q) {
+        ll t, p, v;
+        cin >> t >> p >> v;
+        queries.emplace_back(t, p, v);
+        if (t == 0) {
+            inserts.emplace_back(i, p, v);
+        }
+    }
+
+    reverse(queries.begin(), queries.end());
+    sort(inserts.begin(), inserts.end());
+}