Cod sursa(job #703640)
| Utilizator | Data | 2 martie 2012 13:22:34 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<cstdio>
#include<set>
using namespace std;
#define N 200001
int v[N],nr;
multiset<int>heap;
multiset<int>::iterator it;
int main(){
int k,x,n;
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;++i){
scanf("%d",&k);
if(k!=3) scanf("%d",&x);
if(k==1){
v[++nr]=x;
heap.insert(x);
}
if(k==2)
heap.erase(heap.find(v[x]));
if(k==3){
it=heap.begin();
printf("%d\n",*it);
}
}
return 0;
}
