Pagini recente » Cod sursa (job #2901353) | Cod sursa (job #3319019) | Cod sursa (job #2942898) | Borderou de evaluare (job #1128594) | Cod sursa (job #2218702)
#include <fstream>
#include <set>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
set <int> heap;
int v[200001];
int main()
{
int n,c,x,i,cnt=0;
in>>n;
for(i=1;i<=n;i++)
{
in>>c;
if(c==1)
{
in>>v[++cnt];
heap.insert(v[cnt]);
}
else if(c==2)
{
in>>x;
heap.erase(v[x]);
}
else
out<<*heap.begin()<<'\n';
}
return 0;
}