Cod sursa(job #917733)
Utilizator | Denis Crudu crudu_denis | Data | 18 martie 2013 11:59:37 |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include<cstdio>
#include<set>
#define nmax 200009
using namespace std;
set<int> s;
int n,v[nmax],m;
int main()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%d",&n);
set<int>:: iterator i;
for(;n;--n)
{
int tip,x;
scanf("%d",&tip);
if(tip==1 || tip==2)
{
scanf("%d",&x);
if(tip==1)
{
v[++m]=x;
s.insert(x);
}
if(tip==2)
{
s.erase(v[x]);
}
}
else
printf("%d\n",*s.begin());
}
return 0;
}