Cod sursa(job #1793073)
| Utilizator | Data | 30 octombrie 2016 19:19:55 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <cstdio>
#include <set>
using namespace std;
set<int> s;
int ap[200000], lap = 0;
set<int>::iterator it;
int main()
{
int n, i, op, x;
freopen("heapuri.in", "r", stdin);
freopen("heapuri.out", "w", stdout);
scanf("%d", &n);
for(i = 0; i < n; i++)
{
scanf("%d", &op);
if(op == 1)
{
scanf("%d", &x);
s.insert(x);
ap[lap++] = x;
}
else if(op == 2)
{
scanf("%d", &x);
s.erase(ap[x - 1]);
}
else
{
printf("%d\n", *s.begin());
}
}
return 0;
}
