Cod sursa(job #2999079)
| Utilizator | Data | 10 martie 2023 14:48:17 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream cin("heapuri.in");
ofstream cout("heapuri.out");
const int MAX = 2e5 + 1;
multiset <int> s;
int v[MAX] , op , n , x , k;
int main()
{
cin >> n;
while(n--){
cin >> op;
if(op == 1){
cin >> x;
v[++k] = x;
s.insert(v[k]);
}
if(op == 2){
cin >> x;
s.erase(v[x]);
}
if(op == 3){
auto it = s.begin();
cout << *it << '\n';
}
}
return 0;
}
