#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
multiset<long long> setik;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
setik.insert(x);
}
int q;
cin >> q;
vector<long long> rem;
for (int j = 0; j < q; j++) {
int type;
cin >> type;
if (type == 1) {
long long s, k;
cin >> s >> k;
int ans = 0;
rem.clear();
while (s < k) {
if (setik.empty()) {
ans = -1;
break;
}
auto it = setik.lower_bound(s);
if (it == setik.begin()) {
ans = -1;
break;
}
ans++;
it--;
//cout << "EATING " << s << " " << *it << endl;
s += *it;
rem.push_back(*it);
setik.erase(it);
}
cout << ans << "\n";
for (long long x : rem) {
setik.insert(x);
}
} else if (type == 2) {
long long x;
cin >> x;
setik.insert(x);
} else {
long long x;
cin >> x;
setik.erase(setik.find(x));
}
}
return 0;
}
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 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; multiset<long long> setik; for (int i = 0; i < n; i++) { long long x; cin >> x; setik.insert(x); } int q; cin >> q; vector<long long> rem; for (int j = 0; j < q; j++) { int type; cin >> type; if (type == 1) { long long s, k; cin >> s >> k; int ans = 0; rem.clear(); while (s < k) { if (setik.empty()) { ans = -1; break; } auto it = setik.lower_bound(s); if (it == setik.begin()) { ans = -1; break; } ans++; it--; //cout << "EATING " << s << " " << *it << endl; s += *it; rem.push_back(*it); setik.erase(it); } cout << ans << "\n"; for (long long x : rem) { setik.insert(x); } } else if (type == 2) { long long x; cin >> x; setik.insert(x); } else { long long x; cin >> x; setik.erase(setik.find(x)); } } return 0; } |
English