Pagini recente » Istoria paginii runda/bairam_aladin/clasament | Istoria paginii algoritmiada-2019/runda-preoji/solutii/tablou | Arhiva de probleme | Istoria paginii runda/4_ian_2014/clasament | Cod sursa (job #2369976)
#include <iostream>
#include <fstream>
#include <set>
#define Nmax 200005
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int n, op, x, i;
int in[Nmax];
set <int> s;
int main()
{
f >> n;
while(n--)
{
f >> op;
if(op == 1)
{
f >> x;
in[++i] = x;
s.insert(x);
}
else if(op == 2)
{
f >> x;
s.erase(s.find(in[x]));
}
else
{
g << *s.begin() << '\n';
}
}
return 0;
}