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
#include<bits/stdc++.h>
#define VAR(i,n) __typeof(n) i = (n)
#define loop(i,j,s) for(int i=j;i<s;i++)
#define loopback(i,j,s) for(int i=j;i>=s;i--)
#define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++)
#define pln( x ) cout << x << "\n"
#define ps( x ) cout << x << " "
#define entr cout << "\n"
#define pcnt(i) __builtin_popcount(i)
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define SIZE(c) (c).size()
#define ALL(c) (c).begin(), (c).end()
using namespace std;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef vector<vector<int> > VVI;
const int INFTY=20000000;
const int MAX=500100;
const int MOD=10000000;

void coutTab(int* tab,int n){
	loop(i,0,n){
		cout<<tab[i]<<" ";
	}
	cout<<"\n";
}

template<class T> void coutVec(vector<T> tab){
	for(T t : tab){
		cout<<t<<" ";
	}
	cout<<"\n";
}
//------------------------------------------
multiset<ll> S;

multiset<ll>::iterator last_lower_eq_than(multiset<ll> & A, ll a) {
	auto it = A.lower_bound(a);
	if(it == A.begin()) return A.end();
	it--;
	return it;
}

void give_back(VI & r) {
	while(!r.empty()) {
		S.insert(r[r.size()-1]);
		r.pop_back();
	}
}

int check(ll s,ll k) {
	int i=0;
	VI r;
	while(s < k) {
		auto it = last_lower_eq_than(S, s);
		//ps(s);pln((*it));
		if(it == S.end()) {
			give_back(r);
			return -1;
		}
		s += *it;
		r.pb(*it);
		S.erase(it);
		i++;
	}
	give_back(r);
	return i;
}

int main(){
	ios_base::sync_with_stdio(0);
	int n,w,q,s,k,t;
	cin>>n;
	loop(i,0,n) {
		cin>>w;
		S.insert(w);
	}
	cin>>q;
	while(q--) {
		cin>>t;
		if(t==1) {
			cin>>s>>k;
			pln(check(s,k));
		} else if(t==2) {
			cin>>w;
			S.insert(w);
		} else {
			cin>>w;
			S.erase(S.find(w));
		}
	}
}