Cod sursa(job #2499859)
Utilizator | Data | 26 noiembrie 2019 20:36:02 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
set <int> S;
int n,i,tip,x,dim,v[200010];
int main(){
fin>>n;
for(i=1;i<=n;i++){
fin>>tip;
if(tip==1){
fin>>v[++dim];
S.insert(v[dim]);
}
else
if(tip==2){
fin>>x;
S.erase(v[x]);
}
else
fout<<*S.begin()<<"\n";
}
return 0;
}