Pagini recente » Istoria paginii runda/concurs_000003 | Cod sursa (job #68085) | Cod sursa (job #338376) | Cod sursa (job #1101516) | Cod sursa (job #1663165)
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
const int N_max = 200005;
int v[N_max];
int K;
set <int> H;
int N;
int main()
{
int T, x;
in >> N;
for(int i = 1; i <= N; i++)
{
in >> T;
if(T == 1)
{
in >> x;
H.insert(x);
v[++K] = x;
}
else
{
if(T == 2)
{
in >> x;
H.erase(v[x]);
}
else
out << *H.begin() << '\n';
}
}
return 0;
}