Cod sursa(job #2892767)
Utilizator | Data | 23 aprilie 2022 15:55:40 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <set>
using namespace std;
set<int> h;
int main(){
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n,op,x,ordine[200005],k=1;
f>>n;
for(int i=0;i<n;++i){
f>>op;
if(op==1){
f>>x;
ordine[k]=x;
k++;
h.insert(x);
}
else
if(op==2){
f>>x;
h.erase(ordine[x]);
}
else{
g<<*h.begin()<<'\n';
}
}
return 0;
}