1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include <bits/stdc++.h>
using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef pair<ll, int> PILL;
typedef pair<ll, ll> PLL;

const int MAX_N = 1e5+5;
const int M = 1e6;
const ll INF = (ll)(1e18);
const int inf = 1e9;
const ll MOD = 1000000007LL;

void solve() {

}

int n;
multiset<ll> szprotki;

int getAnswer(ll s, ll k, multiset<ll> st) {
    int ret = 0;
    while (true) {
        auto it = st.lower_bound(s);
        if (it == st.begin()) {
            return -1;
        }
        it--;
        s += (*it);
        ret++;
        st.erase(it);
        if (s >= k) break;
    }

    return ret;
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;
    for (int i = 0; i < n; i++) {
        ll x; cin >> x;
        szprotki.insert(x);
    }
    int Q; cin >> Q;
    for (int i = 0; i < Q; i++) {
        int t;
        cin >> t;
        if (t == 1) {
            ll s, k;
            cin >> s >> k;
            if (s >= k) {
                cout << 0 << "\n";
                continue;
            }
            cout << getAnswer(s, k, szprotki) << "\n";
        } else if (t == 2) {
            ll w; cin >> w;
            szprotki.insert(w);
        } else {
            ll w; cin >> w;
            szprotki.erase(szprotki.find(w));
        }
    }




    return 0;
}