Cod sursa(job #3130543)
| Utilizator | Data | 17 mai 2023 22:42:57 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.78 kb |
#include <iostream>
#include <fstream>
#include <set>
#include <vector>
int main(){
std::ifstream f("heapuri.in");
std::ofstream g("heapuri.out");
std::set<int> numere;
std::vector<int> ordine;
int n, operatie, x;
f >> n;
while(n){
f >> operatie;
switch(operatie){
case 1:{
f >> x;
ordine.push_back(x);
numere.insert(x);
break;
}
case 2:{
f >> x;
numere.erase(ordine[x - 1]);
break;
}
case 3:{
g << *numere.begin() << '\n';
break;
}
}
--n;
}
return 0;
}