Pagini recente » Cod sursa (job #2367022) | Cod sursa (job #1389198) | Cod sursa (job #3239662) | Cod sursa (job #2280539) | Cod sursa (job #2681202)
#include <fstream>
#include <set>
using namespace std;
ifstream fin ("heapuri.in");
ofstream fout ("heapuri.out");
set<int> h;
int place[200001];
int n,i,x,y,k=0;
int main()
{
fin>>n;
for (i=1;i<=n;i++)
{
fin>>x;
if (x==1)
{
fin>>y;
h.insert(y);
place[++k]=y;
}
else if (x==2)
{
fin>>y;
h.erase(place[y]);
}
else
{
fout<<*h.begin()<<'\n';
}
}
return 0;
}