Cod sursa(job #1046554)
| Utilizator | Data | 3 decembrie 2013 09:07:27 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include<cstdio>
#include<set>
using namespace std;
multiset <int> v;
int x,a[400002],n,i,op,m;
int main()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&op);
if(op==1)
{
scanf("%d",&x);
v.insert(x);
m++;
a[m]=x;
}
if(op==2)
{
scanf("%d",&x);
v.erase(v.find(a[x]));
}
if(op==3)
{
printf("%d\n",*v.begin());
}
}
return 0;
}
