Cod sursa(job #1356940)
| Utilizator | Data | 23 februarie 2015 17:41:15 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.68 kb |
#include <cstdio>
#include <set>
using namespace std;
int v[200005];
int main()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
multiset <int> heap;
int t,i,n=0,o,x;
scanf("%d",&t);
for(i=1;i<=t;i++)
{
scanf("%d",&o);
if(o==3)
{
multiset <int> :: iterator it = heap.begin();
printf("%d\n",*it);
}
else
{
scanf("%d",&x);
if(o==1)
{
v[++n]=x;
heap.insert(x);
}
else
heap.erase(heap.find(v[x]));
}
}
return 0;
}
