Pagini recente » Cod sursa (job #806202) | Cod sursa (job #2122673) | Cod sursa (job #1391165) | Cod sursa (job #2116526) | Cod sursa (job #2618243)
#include <fstream>
#include <set>
using namespace std;
ifstream in ("heapuri.in");
ofstream out ("heapuri.out");
const int MAXN = 200000;
int v[1 + MAXN];
set <int> S;
int main()
{
int N, cnt = 0;
in >> N;
for (int i = 0; i < N; i++)
{
int somon, x;
in >> somon;
if(somon == 1)
{
in >> x;
S.insert(x);
v[++cnt] = x;
}
else if(somon == 2)
{
in >> x;
S.erase(v[x]);
}
else
{
out << *(S.begin()) << '\n';
}
}
return 0;
}