Cod sursa(job #3236665)
Utilizator | Data | 30 iunie 2024 10:08:38 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
const int nmax = 2e5+10;
int n,operation,value,values[nmax];
set<int> s;
int main(){
fin >> n;
int index = 0;
for(int i = 1;i <=n; i++){
fin >> operation;
if(operation == 1){
fin >> value;
values[++index] = value;
s.insert(value);
}else if(operation == 2){
fin >> value;
s.erase(values[value]);
}else{
fout << *s.begin() << '\n';
}
};
return 0;
}