Submission #29716164

---

Source Code Expand

// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
// using mint = modint1000000007;
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = (k); i < (n); ++i)
using namespace std;
using ll = long long;

void query(multiset<ll> &s, ll sign) {
    ll x, k;
    cin >> x >> k;
    auto it = s.lower_bound(sign * x);
    if (it == s.end()) {
        cout << -1 << endl;
        return;
    }

    int rem = k - 1;
    while (it != s.end() && rem) {
        it++;
        rem--;
    }
    if (it == s.end()) cout << -1 << endl;
    else cout << sign * (*it) << endl;
}

void solve() {
    int q;
    cin >> q;
    multiset<ll> s2, s3;

    rep(i,q) {
        ll t;
        cin >> t;
        if (t == 1) {
            ll x;
            cin >> x;
            s2.insert(-x);
            s3.insert(x);
        } else if (t == 2) {
            query(s2, -1);
        } else {
            query(s3, 1);
        }
    }
}

int main() {
    solve();
    return 0;
}

Submission Info

Judge Result