Cod sursa(job #2896320)
| Utilizator | Data | 29 aprilie 2022 22:02:10 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int main()
{
int n, instr, x, nr = 0;
f >> n;
set <int> heapus;
int ord[200001];
for(int i = 0; i < n; i++)
{
f >> instr;
if(instr == 1)
{
f >> x;
nr++;
ord[nr] = x;
heapus.insert(x);
}
if(instr == 2)
{
f >> x;
heapus.erase(ord[x]);
}
if(instr == 3)
g << *heapus.begin() <<"\n";
}
return 0;
}
