Cod sursa(job #2745824)
Utilizator | Data | 27 aprilie 2021 00:37:46 | |
---|---|---|---|
Problema | Heapuri | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
long long n, b, a, k;
set<int> s;
int v[10001];
int main(){
in>>n;
for(int i=0;i<n;++i){
in>>a;
if(a==1){
in>>b;
s.insert(b);
v[++k]=b;
}
else if(a==2){
in>>b;
s.erase(v[b]);
}
else{
out<<*s.begin()<<endl;
}
}
return 0;
}