Cod sursa(job #2896206)
| Utilizator | Data | 29 aprilie 2022 21:12:24 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
set<int> heap;
int ord[200000];
int main() {
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n, op, c = 0, nr;
f >> n;
for (int i = 0; i < n; i++) {
f >> op;
if (op == 3)
g << *(heap.begin()) << "\n";
else {
f >> nr;
if (op == 1) {
heap.insert(nr);
ord[++c] = nr;
} else
heap.erase(ord[nr]);
}
}
f.close();
g.close();
return 0;
}