Submission #1871022

---

Source Code Expand

#include <iostream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<class T> using Set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class TKey, class TVal> using Map = tree<TKey, TVal, less<TKey>, rb_tree_tag, tree_order_statistics_node_update>;

int main() {
  int q;
  cin >> q;

  Set<int> st;

  while (q--) {
    int t, x;
    cin >> t >> x;

    if (t == 1) {
      st.insert(x);
    } else {
      auto it = st.find_by_order(x - 1);
      cout << *it << endl;
      st.erase(it);
    }
  }
}

Submission Info

Judge Result