Pagini recente » Cod sursa (job #3169660) | Cod sursa (job #2698396) | Cod sursa (job #2538205) | Cod sursa (job #2190609) | Cod sursa (job #2484688)
#include <set>
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set<int> a;
int v[200005], n, k = 1, q, val;
int main()
{
f >> n;
for (int i = 0; i < n; ++i)
{
f >> q;
if (q == 1)
{
f >> val;
a.insert(val);
v[k++] = val;
}
else if (q == 2)
{
f >> val;
a.erase(v[val]);
}
else
{
g << *a.begin() << '\n';
}
}
}