Cod sursa(job #2746460)
| Utilizator | Data | 27 aprilie 2021 21:46:32 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<iostream>
#include<fstream>
#include<set>
#include<vector>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int main(){
int op,i,n,val,count=1;
set<int> heap;
vector<int> v;
v.assign(200002,0);
f>>n;
for(i=0;i<n;++i){
f>>op;
if(op==1){
f>>val;
heap.insert(val);
v[count]=val;
++count;
}
else if(op==2){
f>>val;
heap.erase(v[val]);
}
else{
g<<*heap.begin()<<'\n';
}
}
return 0;
}