Pagini recente » Cod sursa (job #2599464) | Cod sursa (job #2829783) | Cod sursa (job #2091570) | Cod sursa (job #895876) | Cod sursa (job #2601285)
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int N;
int a[200005];
set<int> ST;
int main()
{
fin >> N;
int i,contor=0;
for (i=1;i<=N;++i)
{
int op;
fin >> op;
if (op==1)
{
++contor;
fin >> a[contor];
ST.insert(a[contor]);
}
else if (op==2)
{
int x;
fin >> x;
ST.erase(a[x]);
}
else
{
fout << *ST.begin() << '\n';
}
}
fin.close();
fout.close();
return 0;
}