Pagini recente » Cod sursa (job #3152785) | fmi-no-stress-9-warmup/solutii | Cod sursa (job #1856585) | Cod sursa (job #120849) | Cod sursa (job #2026210)
#include <iostream>
#include <fstream>
#include <set>
#include <vector>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
set<int> heap;
vector<int> inserted;
int main()
{
int n, op, val;
for (in >> n; n; --n) {
in >> op;
switch(op) {
case 1:
in >> val;
heap.insert(val);
inserted.push_back(val);
break;
case 2:
in >> val;
heap.erase(inserted[val - 1]);
break;
case 3:
out << *heap.begin() << "\n";
break;
}
}
in.close();
out.close();
return 0;
}