Cod sursa(job #2896266)
Utilizator | Data | 29 aprilie 2022 21:32:25 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
#include <set>
using namespace std;
int main()
{
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
unsigned int pozitie[200001], n, poz=1, op, x;
set <unsigned int> heap;
fin >> n;
for (int i = 0; i < n; i++) {
fin >> op;
switch (op)
{
case 1:
fin >> x;
heap.insert(x);
pozitie[poz++] = x;
break;
case 2:
fin >> x;
heap.erase(pozitie[x]);
break;
case 3:
fout << *(heap.begin()) << "\n";
}
}
fin.close();
fout.close();
return 0;
}