Cod sursa(job #1041371)
Utilizator | Data | 25 noiembrie 2013 19:32:55 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include<cstdio>
#include<cstring>
#include<set>
#define ins insert
using namespace std;
multiset <int> H;
int V[200010],N,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",&k);
if (k==1)
{
scanf("%d",&x);
V[++n]=x;
H.insert(x);
}
if (k==2)
{
scanf("%d",&x);
H.erase(H.find(V[x]));
}
if (k==3) printf("%d\n",*(H.begin()));
}
fclose(stdin);
fclose(stdout);
return 0;
}