Cod sursa(job #2886688)
Utilizator | Data | 8 aprilie 2022 01:29:54 | |
---|---|---|---|
Problema | Heapuri | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set <int> s;
int main()
{int x, n, i, op, arr[200005], c = 0;
f>>n;
for(i=1; i<=n; i++){
f>>op;
if(op == 1){
f>>x;
s.insert(x);
c++;
arr[c] = x;
}else{
if(op == 2){
f>>x;
s.erase(arr[x]);
}else{
g<<*s.begin()<<endl;
}
}
}
f.close();
g.close();
return 0;
}