Cod sursa(job #1568297)
Utilizator | Data | 14 ianuarie 2016 08:18:31 | |
---|---|---|---|
Problema | Heapuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int th[200003];
set <int> H;
int main()
{int n,i,x,op,cnt=0;
in>>n;
for(i=1;i<=n;i++)
{
in>>op;
if(op==1)
{
in>>x;
th[++cnt]=x;
H.insert(x);
}
if(op==2)
{
in>>x;
H.erase(th[x]);
}
if(op==3)
{
out<<*H.begin()<<'\n';
}
}
return 0;
}