Cod sursa(job #2302731)
Utilizator | Data | 15 decembrie 2018 09:03:01 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <set>
#include <fstream>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
set<int> h;
int place[200001];
int main()
{
int n,x,p,k=0;
f>>n;
for(int i=1;i<=n;++i)
{
f>>p;
if(p==1)
{
f>>x;
h.insert(x);
place[++k]=x;
}
else if(p==2)
{
f>>x;
h.erase(place[x]);
}
else{
g<<*h.begin()<<'\n';
}
}
return 0;
}