Cod sursa(job #2889235)
Utilizator | Data | 12 aprilie 2022 14:51:37 | |
---|---|---|---|
Problema | Heapuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
int main(){
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n, a, b, v[100 000 001], j= 0;
set <int> multime;
f>>n;
for (int i = 1; i<=n;i++){
f>>a;
if( a== 1){
f>>b;
multime.insert(b);
j++;
v[j]= b;
}
else if( a== 2){
f>> b;
multime.erase(v[b]);
}
else{
g<< *multime.begin() <<endl;
}
}
f.close();
g.close();
}