Pagini recente » Cod sursa (job #1527470) | Cod sursa (job #3151553) | Cod sursa (job #2226595) | Cod sursa (job #542675) | Cod sursa (job #2298690)
#include <fstream>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int k, inserted[200005];
set <int> Q;
int main()
{
int N;
fin >> N;
int x, y;
for(int i = 1; i <= N; i++)
{
fin >> x;
if(x == 1)
{
fin >> y;
inserted[++k] = y;
Q.insert(y);
}
else if(x == 2)
{
fin >> y;
Q.erase(inserted[y]);
}
else
fout << *(Q.begin()) << '\n';
}
return 0;
}