Cod sursa(job #1043062)
| Utilizator | Data | 27 noiembrie 2013 22:43:21 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.78 kb |
#include <iostream>
#include <set>
#include <cstdio>
#define Nmax 200001
using namespace std;
multiset <int>s;
multiset<int>::iterator it;
int v[Nmax];
int n,i,k=0;
int main()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;++i)
{
int op;
scanf("%d",&op);
if (op==1)
{
int x;
scanf("%d",&x);
s.insert(x);
++k;
v[k]=x;
}
else if (op==2)
{
int x;
scanf("%d",&x);
s.erase(v[x]);
}
else
{
it=s.begin();
printf("%d\n",*it);
}
}
return 0;
}
