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
#include <bits/stdc++.h>

using namespace std;

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    multiset<int64_t> fish;

    for (int i = 1; i <= n; ++i) {
        int64_t x;
        cin >> x;
        fish.insert(x);
    }

    int q;
    cin >> q;

    vector<int64_t> store(n + q);

    while (q--) {
        int q_type;
        cin >> q_type;
        switch (q_type) {
            case 1: {
                int64_t s, k;
                cin >> s >> k;

                int store_idx = 0, steps;

                for (steps = 0; !fish.empty() && s < k; ++steps) {
                    auto it = fish.lower_bound(s);
                    if (it == fish.begin())
                        break;
                    it = prev(it);
                    s += *it;
                    store[store_idx++] = *it;
                    fish.erase(it);
                }

                while (store_idx > 0)
                    fish.insert(store[--store_idx]);

                cout << (s < k ? -1 : steps) << '\n';
            }
                break;
            case 2: {
                int64_t w;
                cin >> w;
                fish.insert(w);
            }
                break;
            case 3: {
                int64_t w;
                cin >> w;
                fish.erase(fish.find(w));
            }
                break;
            default:
                break;
        }
    }
}