Cod sursa(job #1992174)
Utilizator | Data | 19 iunie 2017 19:14:50 | |
---|---|---|---|
Problema | Heapuri | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
#include<set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int a[200005],n,cod,x,nr;
set<int>s;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>cod;
if(cod==1)
{
fin>>x;
nr++;
a[nr]=x;
s.insert(x);
}
if(cod==2)
{
fin>>x;
s.erase(s.find(a[x]));
}
if(cod==3)
fout<<*s.begin()<<'\n';
}
}