Pagini recente » Cod sursa (job #3185851) | Cod sursa (job #343442) | Cod sursa (job #1432150) | Cod sursa (job #2032281) | Cod sursa (job #1042217)
#include <fstream>
using namespace std;
ifstream in("heapuri.in");
ofstream out("heapuri.out");
int n, poz[200001], h[200001], v[200001];
void schimba(int a, int b)
{
int aux=h[a];
h[a]=h[b];
h[b]=aux;
poz[h[a]]=a;
poz[h[b]]=b;
}
void urca(int p)
{
while(p>1&&v[h[p]]<v[h[p/2]])
{
schimba(p, p/2);
p/=2;
}
}
/*
void adauga(int x)
{
h[++n]=x;
urca(n);
}
*/
void coboara(int p)
{
int l=2*p, r=2*p+1, bun=p;
if(l<=n&&v[h[l]]<v[h[bun]])
bun=l;
if(r<=n&&v[h[r]]<v[h[bun]])
bun=r;
if(bun!=p)
{
schimba(bun, p);
coboara(bun);
}
}
void sterge(int p)
{
schimba(p, n--);
urca(p);
coboara(p);
}
int main()
{
int m, i, nr=0, tip, p;
in>>m;
for(i=1;i<=m;i++)
{
in>>tip;
if(tip==1)
{
in>>v[++nr];
poz[nr]=++n;
h[n]=nr;
urca(n);
}
if(tip==2)
{
in>>p;
sterge(poz[p]);
}
if(tip==3)
{
out<<v[h[1]]<<"\n";
}
}
return 0;
}