Pagini recente » Cod sursa (job #1297657) | Borderou de evaluare (job #1113789) | Cod sursa (job #1403696) | Cod sursa (job #3224893) | Cod sursa (job #3131706)
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
int v[200001],l,n;
int main() {
f>>n;
set<int> heap;
int c,x;
for(int i=1;i<=n;i++)
{
f>>c;
if(c==1)
{
f>>x;
v[l++]=x;
heap.insert(x);
}
if(c==2)
{
f>>x;
heap.erase(v[x-1]);
}
if(c==3)
{
g<<*heap.begin()<<endl;
}
}
}