Cod sursa(job #2925777)
Utilizator | Data | 16 octombrie 2022 00:11:21 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <set>
#define MAX 200002
using namespace std;
int n,t,x,v[MAX],cnt;
set<int> s;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int main()
{
fin >> n;
for(int i = 1; i <= n; i++){
fin >> t;
if(t == 1){
fin >> x;
v[++cnt] = x;
s.insert(x);
}else if(t == 2){
fin >> x;
s.erase(v[x]);
}else{
fout << *s.begin() << "\n";
}
}
return 0;
}