Pagini recente » Cod sursa (job #2832090) | Cod sursa (job #498832) | Cod sursa (job #3166390) | Cod sursa (job #1323928) | Cod sursa (job #2896652)
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set <int> heap;
int main(){
int n,op,v[200001],k=1,x, nr=1;
f>>n;
for(int i=1;i<=n;i++)
{
f>>k;
if(k==1)
{
f>>x;
heap.insert(x);
v[nr]=x;
nr++;
}
else if(k==2)
{
f>>x;
heap.erase(v[x]);
}
else
{
g<<*heap.begin()<<"\n";
}
}
}