Pagini recente » Cod sursa (job #2814584) | Cod sursa (job #265388) | Cod sursa (job #928542) | Cod sursa (job #2966244) | Cod sursa (job #2939580)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
const int NMAX = 200005;
int v[NMAX], n, k;
set<int>s;
vector<int>idx;
int main()
{
fin >> n;
for(int i=1;i<=n;++i)
{
int x, y;
fin >> x;
if(x == 1)
{
fin >> y;
v[++k] = y;
s.insert(y);
}
else if(x == 2)
{
fin >> y;
s.erase(v[y]);
}
else if(x == 3)
{
idx.push_back(*s.begin());
}
}
for(auto x : idx)
fout << x << '\n';
}