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
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
#include <bits/stdc++.h>
// #define MULTIPLE_TESTS
// #define ENDLESS_TESTS
#define MEMORY_LIMIT 128
// #define TIME_LIMIT 1.0

using namespace std;

constexpr long long END = 2'000'000'000'000'000'000 + 2;

struct Tree {
    Tree *up = nullptr;
    Tree *left = nullptr;
    Tree *right = nullptr;
    Tree *first = nullptr;
    Tree *last = nullptr;

    long long sum = 0;
    long long max = 0;
    int count = 0;
    bool used = false;
};

void test()
{
    // cerr << "hi" << endl;
    deque<Tree> tree;

    {
        auto push_tree = [&](long long val)
        {
            Tree *left = tree.empty() ? nullptr : &tree.back();

            tree.push_back({});
            Tree *me = &tree.back();

            if (left)
                left->right = me;
            me->left = left;

            me->sum = val;
            me->max = val;
            me->count = 1;
        };

        int n;
        cin >> n;

        vector<long long> values(n);
        for (auto &val : values)
            cin >> val;

        sort(values.begin(), values.end());

        for (auto val : values)
        {
            push_tree(val);
        }
        push_tree(END);
    }

    auto root = &tree.back();

    auto find_greater_or_equal = [&](long long value)
    {
        auto e = root;
        while(e->left && e->left->max >= value)
            e = e->left;

        return e;
    };

    stack<Tree*> stack;

    auto eat = [&](long long &size, long long target_size, int &count)
    {
        while (size < target_size)
        {
            if (stack.empty()) return false;

            auto e = stack.top();
            stack.pop();

            const bool add = [&]()
            {
                while (size < target_size)
                {
                    e = e->left;
                    if (!e) return false;
                    if (e->used) return false;
                    e->used = true;
                    size += e->sum;
                    count += e->count;
                    // cerr << "Eating #" << e->count << " size = " << e->sum << "  szczupak = " << size << endl;
                }

                return true;
            }();

            if (add)
                stack.push(e);
        }

        return true;
    };
    
    auto query = [&]()
    {
        long long current_size, final_goal;
        cin >> current_size >> final_goal;
        // cerr << "query " << current_size << ' ' << final_goal << endl;

        for (auto &t : tree) t.used = false;
        while(!stack.empty()) stack.pop();

        // cerr << "Start size = " << current_size << endl;
        // cerr << "final goal = " << final_goal << endl;
        {
            auto e = root;
            while(e->left)
                e = e->left;
            
            while(e)
            {
                // cerr << e->sum << ' ';
                e = e->right;
            }
            // cerr << endl;
        }
        int count = 0;

        while (current_size < final_goal)
        {
            auto e = find_greater_or_equal(current_size);
            const long long x = min(final_goal, e->max+1);
            // cerr << "Trying to eat until " << x << endl;
            // cerr << "size = " << current_size << endl;
            stack.push(e);

            const bool ok = eat(current_size, x, count);
            if (!ok) break;
        }

        // cerr << "End size = " << current_size << endl;
        // cerr << "count = " << count << endl;

        if (current_size < final_goal)
            cout << -1 << '\n';
        else
            cout << count << '\n';

        // cerr << endl;
    };

    auto add = [&]()
    {
        long long w;
        cin >> w;
        // cerr << "add " << w << endl;
        auto e = find_greater_or_equal(w);
        
        tree.push_back({});
        auto me = &tree.back();
        
        me->left = e->left;
        me->right = e;
        if (me->left)
            me->left->right = me;
        e->left = me;

        me->sum = w;
        me->max = w;
        me->count = 1;
    };

    auto remove = [&]()
    {
        long long w;
        cin >> w;
        // cerr << "remove " << w << endl;
        auto me = find_greater_or_equal(w);
        auto right = me->right;
        auto left = me->left;
        
        if (left)
            left->right = right;
        right->left = left;

    };

    int q;
    cin >> q;
    while (q --> 0)
    {
        int type;
        cin >> type;
        switch (type)
        {
            case 1:
                query();
                break;
            case 2:
                add();
                break;
            case 3:
                remove();
                break;
        }
    }
}

/******************************************************************************/

int main()
{
#ifdef CONTEST_WORKSPACE
    #ifdef MEMORY_LIMIT
        void limit_ram(float);
        limit_ram(MEMORY_LIMIT);
    #endif
    #ifdef MEMORY_LIMIT
        void limit_cpu(float);
        limit_cpu(TIME_LIMIT);
    #endif
#endif

#if !defined(CONTEST_WORKSPACE)
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
#endif

#if defined(MULTIPLE_TESTS)
    int T = 0;
    cin >> T;

    while (T --> 0)
        test();

#elif defined(ENDLESS_TESTS)
    while(!(cin >> std::ws).eof())
        test();

#else
    test();
#endif

    return EXIT_SUCCESS;
}