Mai intai trebuie sa te autentifici.
Cod sursa(job #2002750)
| Utilizator | Data | 20 iulie 2017 18:02:43 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <cstdio>
#include <set>
#define NMax 200005
using namespace std;
int main()
{
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
multiset<int> H;
int q,caz,x,loc = 0;
int a[NMax] = { };
scanf("%d",&q);
while(q--){
scanf("%d",&caz);
if(caz == 1){
scanf("%d",&x);
a[++loc] = x;
H.insert(x);
}else
if(caz == 2){
scanf("%d",&x);
H.erase(a[x]);
}else{
printf("%d\n",*H.begin());
}
}
return 0;
}
