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
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <bitset>

using namespace std;

typedef unsigned long long LL;

#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(val) ((val) < 0 ? -(val) : (val))

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

#define M 1000000007ULL

/* PA2019 "SIS" */

struct classcomp {
  bool operator() (const LL& lhs, const LL& rhs) const
  {return lhs>rhs;}
};
  
void solve (multiset<LL, classcomp> pond, LL s, LL k)
{
	#if 0
	printf ("Size %d, s: %lld, k: %lld\n", pond.size(), s, k);
	FOREACH(v, pond)
		printf("%lld ", *v);
	printf("\n");
	#endif
	
	int i = 0;
	
	multiset<LL, classcomp>::iterator it;
		
	while (s < k) {
		it = pond.upper_bound(s);
		
		if (it == pond.end()) {
			i = -1;
			break;
		}
		
		i++;
		s += *it;
		pond.erase(it);
		
	}
	
	
	printf("%d\n", i);	
	
	
	
	
	
	
	
	
	
}

LL tmp [310000];
int main() {

	int n;
	scanf("%d\n", &n);
	
	REP(i, n) {
		scanf("%lld", &tmp[i]);
	}
	
	multiset<LL, classcomp> s (tmp, tmp + n);
	multiset<LL, classcomp>::iterator it;
	
	int cas;
	scanf("%d", &cas);
	
	REP(i, cas) {
		int mod;
		scanf ("%d",&mod);
		
		//printf ("Case %d, (Size %d)\n", i, s.size());

		if (mod == 2) {
			LL r;
			scanf("%lld", &r);
			s.insert(r);
		} else if (mod == 3) {
			LL r;
			scanf("%lld", &r);
			it = s.find(r);
			s.erase(it);
		}
		else
		{
			LL ss, k;
			scanf("%lld %lld", &ss, &k);
			solve(s, ss, k);	
		}
	
	}
	
	
	

	
	

	


	return 0;
}