Pagini recente » Cod sursa (job #3346513) | Cod sursa (job #2549809) | Cod sursa (job #3356716) | Cod sursa (job #849374) | Cod sursa (job #3339970)
#include <iostream>
#include <fstream>
#include <set>
#define Max 200005
using namespace std;
ifstream fin("heapuri.in");
ofstream fout("heapuri.out");
set <pair<int,int>> S;
int n,cod,v[Max],cnt=0;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>cod;
if(cod==1)
{
int x;
fin>>x;
cnt++;
S.insert({x,cnt});
v[cnt]=x;
}
else if(cod==2)
{
int x;
fin>>x;
S.erase({v[x],x});
}
else
{
fout<<(*S.begin()).first<<"\n";
}
}
return 0;
}