Pagini recente » Cod sursa (job #1444352) | Cod sursa (job #736490) | Cod sursa (job #1915295) | Cod sursa (job #213068) | Cod sursa (job #1710581)
#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==1)
{fin>>y;
s.insert(y);
v[++k]=y;
}
if(x==2)
{
fin>>y;
for(it=s.begin();it!=s.end();++it)
if(*it==v[y])
{s.erase(it);break;}
}
if(x==3)
{
it=s.begin();
fout<<*it<<endl;
}
}
return 0;
}