Cod sursa(job #2716269)
| Utilizator | Data | 4 martie 2021 22:02:35 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
#define NMAX 200005
int n, nr, v[NMAX];
multiset<int> heap;
int main() {
f >> n;
int op, x;
for (int i = 1; i <= n; ++i) {
f >> op;
if (op == 1) {
f >> x;
heap.insert(x);
v[++nr] = x;
} else if (op == 2) {
f >> x;
heap.erase(v[x]);
} else
g << *heap.begin() << '\n';
}
return 0;
}
