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