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
#include <iostream>
#include <set>

using namespace std;

typedef long long ll;

int main()
{
    ios_base::sync_with_stdio(0);
    int n;
    cin >> n;
    multiset<ll> w;
    for (int i = 0; i < n; ++i)
    {
        ll x;
        cin >> x;
        w.insert(-x);
    }
    int q;
    cin >> q;
    for (int i = 0; i < q; ++i)
    {
        int op;
        cin >> op;
        if (op == 1)
        {
            ll a, b;
            cin >> a >> b;
            multiset<ll> t = w;
            int odp = 0;
            while (t.size() != 0 && a < b)
            {
                multiset<ll>::iterator it = t.lower_bound(-(a - 1));
                if (it == t.end())
                    break;
                a += -(*it);
                ++odp;
                t.erase(it);
            }
            if (a >= b)
                cout << odp << endl;
            else
                cout << "-1" << endl;
        }
        if (op == 2)
        {
            ll x;
            cin >> x;
            w.insert(-x);
        }
        if (op == 3)
        {
            ll x;
            cin >> x;
            w.erase(w.find(-x));
        }
    }
    return 0;
}