Cod sursa(job #1110103)
| Utilizator | Data | 17 februarie 2014 20:38:05 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<set>
#include<cstdio>
#define maxn 200001
using namespace std;
int n,m,x,y,aux,co,caz,i,v[maxn],j,p;
multiset<int> miritmo;
multiset<int>::iterator k;
int main(){
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;++i){
scanf("%d",&caz);
if(caz==1){
scanf("%d",&p);
v[++j]=p;
miritmo.insert(p);}
if(caz==2){
scanf("%d",&p);
miritmo.erase(miritmo.find(v[p]));
}
if(caz==3)
{
k=miritmo.begin();
printf("%d\n",*k);
}
}
return 0;
}