Cod sursa(job #2580857)
Utilizator | Octavian Neculau 1chiriac | Data | 14 martie 2020 11:49:50 |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
int m,v[200005],q,nr;multiset <int> heap1;
int main () {
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%d", &m);++m;
while(--m) {
scanf("%d", &q);
if(q==1)
scanf("%d", &nr),heap1.insert(nr),v[++v[0]]=nr;
else if (q==2)
scanf("%d", &nr),heap1.erase(heap1.find(v[nr]));
else
printf("%d\n", *heap1.begin());
}
return 0;
}