Cod sursa(job #3131153)
Utilizator | Data | 19 mai 2023 13:02:52 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <bits/stdc++.h>
#define N 200005
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int valori[N], n, tipOperatie, element, k;
set<int> multimeElemente;
int main() {
f >> n;
for (int i = 1; i <= n; i++) {
f >> tipOperatie;
if (tipOperatie == 1) {
f >> element;
valori[++k] = element;
multimeElemente.insert(element);
}
else if (tipOperatie == 2) {
f >> element;
multimeElemente.erase(valori[element]);
}
else {
g << *multimeElemente.begin() << "\n";
}
}
return 0;
}