Cod sursa(job #914695)
| Utilizator | Data | 14 martie 2013 12:53:03 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<cstdio>
#include<set>
#include<algorithm>
using namespace std;
int n,i,j,k,x;
set<int>s;
int v[200005];
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!=3) scanf("%d",&x);
if (k==3) printf("%d\n",*s.begin());else
if (k==1) s.insert(x),v[++j]=x;else
if (k==2) s.erase(v[x]);
}
return 0;
}