Cod sursa(job #3041755)
Utilizator | Data | 1 aprilie 2023 13:58:40 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <set>
using namespace std;
int cnt=0,n,v[200001];
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
multiset<int>s;
int main(){
fin>>n;
for(int ll=1;ll<=n;ll++){
int cer; fin>>cer;
if(cer==1){
int x; fin>>x;
v[++cnt]=x;
s.insert(x);
}
else if(cer==2){
int x; fin>>x;
s.erase(v[x]);
}
else
fout<<*s.begin()<<'\n';
}
return 0;
}