Cod sursa(job #380757)
| Utilizator | Data | 7 ianuarie 2010 17:00:08 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <stdio.h>
#include <vector>
#include <set>
#define max 200010
using namespace std;
multiset <int> h;
multiset<int>::iterator it;
int a[max],n,i,j,op,k;
int main()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%d",&n);
for(; n>0; n--)
{
scanf("%d",&op);
if(op==1) { scanf("%d",&i); a[++j]=i; h.insert(i); }
if(op==2) { scanf("%d",&i); h.erase(h.find(a[i])); }
if(op==3) { it=h.begin(); printf("%d\n",*it); }
}
return 0;
}
