Cod sursa(job #2600966)
Utilizator | Data | 13 aprilie 2020 15:02:32 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
const int N = 2e5+507;
int n,i,op,x,k,val[N];
set <int> s;
int main()
{
in>>n;
for (i=1;i<=n;++i)
{
in>>op;
if (op==1)
{
in>>x;
val[++k]=x;
s.insert(x);
}
else if (op==2)
{
in>>x;
s.erase(val[x]);
}
else out<<*s.begin()<<"\n";
}
}