Cod sursa(job #2925405)
| Utilizator | Data | 15 octombrie 2022 10:09:00 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
int a[200001];
set<int> heap;
int main(void){
ofstream cout("heapuri.out");
ifstream cin("heapuri.in");
int n,p,k = 0,x;
cin >>n;
for(int i = 1;i<=n;i++){
cin >> p;
if(p == 1){
cin >> x;
heap.insert(x);
a[++k] = x;
}else if(p == 2){
cin >> x;
heap.erase(a[x]);
}else{
cout << *heap.begin() << '\n';
}
}
}
