Cod sursa(job #2304870)
| Utilizator | Data | 18 decembrie 2018 18:58:07 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
set <int> li;
set <int>::iterator it;
int n,i,v[20001],act,tip,x;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>tip;
if(tip!=3)
fin>>x;
if(tip==1)
{
act++;
li.insert(x);
v[act]=x;
}
if(tip==2)
{
it=li.find(v[x]);
li.erase(it);
}
if(tip==3)
{
it=li.begin();
fout<<* it<<'\n';
}
}
return 0;
}
