Cod sursa(job #3132242)
Utilizator | Caraiman Ana Anacrm | Data | 22 mai 2023 00:40:02 |
---|---|---|---|
Problema | Heapuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <set>
#include <fstream>
#define dim 200002
using namespace std;
ifstream f("heapuri.in");
ofstream r("heapuri.out");
int main(){
int n, i, s, m, p = 1, v[dim];
set<int> heap;
f>>n;
for (i=0; i<n; i++){
f>>s;
if(s == 1){
f>>v[p];
heap.insert(v[p-1]);
} else if (s == 2){
f>>m;
heap.erase(v[m]);
} else {
set<int>::iterator t = heap.begin();
r<<*t<<"\n";
}
}
return 0;
}