Cod sursa(job #2561176)
| Utilizator | Data | 28 februarie 2020 17:17:22 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <set>
#define NMAX 200005
using namespace std;
ifstream fin ("heapuri.in");
ofstream fout ("heapuri.out");
int n, k;
int poz[NMAX];
set<int> heap;
int main() {
int i, a, x, cod;
fin >> n;
for (i = 1; i <= n; i++) {
fin >> cod;
if (cod == 1) {
fin >> a;
heap.insert(a);
poz[++k] = a;
} else if (cod == 2) {
fin >> a;
heap.erase(poz[a]);
} else
fout << *heap.begin() << '\n';
}
fin.close();
fout.close();
return 0;
}
