Pagini recente » Cod sursa (job #2436668) | Cod sursa (job #957335) | Cod sursa (job #3216526) | Cod sursa (job #2115742) | Cod sursa (job #2217896)
#include <fstream>
#include <set>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int N, nr, V[200001];
set<int> heap;
int main()
{
int op, x, k;
in >> N;
for(int i = 1; i <= N; i++)
{
in >> op;
if(op == 1)
{
in >> x;
V[++nr] = x;
heap.insert(x);
}
else if(op == 2)
{
in >> k;
heap.erase(V[k]);
}
else
out << *heap.begin() << '\n';
}
return 0;
}