Cod sursa(job #1710591)
| Utilizator | Data | 29 mai 2016 12:40:56 | |
|---|---|---|---|
| Problema | Heapuri | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
set <int> s;
set <int>::iterator it;
int i,n,x,y,v[10000001],k,Min=10000001;
int main()
{
fin>>n;
for(i=1;i<=n;++i)
{
Min=1000000;
fin>>x;
if(x==3)
{
fout<<*s.begin()<<endl;continue;
}
fin>>y;
if(x==1)
{
s.insert(y);
v[++k]=y;
}
if(x==2)
{
s.erase(v[y]);
}
}
return 0;
}
