Cod sursa(job #1650691)
Utilizator | Dinca Liviu Liviu98 | Data | 11 martie 2016 19:52:30 |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.71 kb |
#include <iostream>
#include <cstdio>
#include <set>
#define NMax 200005
using namespace std;
int A[NMax],N,optiune,x;
multiset<int> Heap;
int main()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%d",&N);
for(;N;N--)
{
scanf("%d",&optiune);
if(optiune==1)
{
scanf("%d",&x);
A[++A[0]]=x;
Heap.insert(x);
continue;
}
if(optiune==2)
{
scanf("%d",&x);
Heap.erase(Heap.find(A[x]));
continue;
}
if(optiune==3)
{
printf("%d\n",*Heap.begin());
continue;
}
}
}