Cod sursa(job #2906859)
| Utilizator | Data | 27 mai 2022 16:58:38 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <set>
#define NMAX 200005
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set <int> heap;
int n, v[NMAX], k=1, x, y;
int main()
{
f >> n;
for(int i = 1; i <= n; i++)
{
f >> x;
if(x == 1)
{
f >> y;
heap.insert(y);
v[k] = y;
k++;
}
else if(x == 2)
{
f >> y;
heap.erase(v[y]);
}
else
g << *heap.begin() << '\n';
}
return 0;
}
