显示原始代码
#include <bits/stdc++.h>
#include <set>
using namespace std;
typedef long long ll int main() {
int n;
cin >> n;
multiset<int> c;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
c.insert(x);
}
int q;
cin >> q;
while (q--) {
int op;
cin >> op;
if (op == 1) {
int p;
cin >> p;
c.insert(p);
} else if (op == 2) {
int p;
cin >> p;
auto it = c.find(p);
if (it != c.end()) {
c.erase(it);
}
} else {
int l, r;
cin >> l >> r;
ll sum = 0;
auto start = c.lower_bound(l);
auto end = c.upper_bound(r);
for (auto it = start; it != end; ++it) {
sum += *it;
}
cout << sum << endl;
}
}
return 0;
}