Pagini recente » Diferente pentru problema/dfs intre reviziile 22 si 20 | Cod sursa (job #3245951) | Monitorul de evaluare | Cod sursa (job #2550513) | Cod sursa (job #1605612)
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
int n,x,vec[200001],t;
int main()
{
fin>>n;
set <int> my_set;
for(int i=0;i<n;i++)
{
fin>>x;
if(x==1)
fin>>x,my_set.insert(x),vec[t++]=x;
else if(x==2)
fin>>x,my_set.erase(vec[x-1]);
else
{
fout<<*my_set.begin()<<endl;
}
}
return 0;
}