Cod sursa(job #2906819)
| Utilizator | Data | 27 mai 2022 15:55:32 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
const int n_MAX = 2e5 + 5;
int n, op, x;
int v[n_MAX], cnt;
multiset < int > a;
int main(){
f >> n;
for (int i = 1; i <= n; i++) {
f >> op;
switch(op) {
case 1:
f >> x;
v[++cnt] = x;
a.insert(x);
break;
case 2:
f >> x;
a.erase(v[x]);
break;
default:
g << *a.begin() << "\n";
}
}
return 0;
}