Cod sursa(job #2256257)
Utilizator | Data | 8 octombrie 2018 13:00:39 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
using namespace std;
int n;
set<int> s;
vector<int> v;
int main() {
freopen("heapuri.in", "r", stdin);
freopen("heapuri.out", "w", stdout);
scanf("%d", &n);
int x, op;
for (int i = 0; i < n; ++i) {
scanf("%d", &op);
if (op == 3) {
printf("%d\n", *s.begin());
}
else {
scanf("%d", &x);
if (op == 1) {
s.insert(x);
v.push_back(x);
}
else {
s.erase(v[x - 1]);
}
}
}
return 0;
}