Cod sursa(job #1047063)
| Utilizator | Data | 3 decembrie 2013 21:20:43 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <cstdio>
#include <set>
using namespace std;
int i,j,n,a[200002],x,k,t;
multiset <int> s;
multiset <int>::iterator it;
int main()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%d\n",&n);
for(i=1; i<=n; i++)
{
scanf("%d",&x);
if(x==1)
{
scanf("%d\n",&k);
a[++t]=k;
s.insert(k);
}
if(x==2)
{
scanf("%d\n",&k);
s.erase(s.find(a[k]));
}
if(x==3)
{
it=s.begin();
printf("%d\n",*it);
}
}
return 0;
}
