Pagini recente » Cod sursa (job #2528620) | Cod sursa (job #1915434) | Cod sursa (job #579624) | Borderou de evaluare (job #2638060) | Cod sursa (job #2748626)
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set <int> heap;
vector <int> v;
int n, op, x, y;
int main()
{
f >> n;
while(n--) {
f >> op;
if(op == 1) {
f >> x;
heap.insert(x);
v.push_back(x);
}
else if(op == 2) {
f >> x;
heap.erase(v[x - 1]);
}
else {
g << *(heap.begin()) << '\n';
}
}
}