Pagini recente » Cod sursa (job #1518833) | Cod sursa (job #966504) | Cod sursa (job #555733) | Cod sursa (job #489432) | Cod sursa (job #1425935)
#include <cstdio>
using namespace std;
FILE *in=fopen ("heapuri.in","r");
FILE *out=fopen ("heapuri.out","w");
const int N= 200000;
int v[N],h[N],poz[N],n,nh;
void schimb (int p1,int p2)
{
int aux=h[p1];
h[p1]=h[p2];
h[p2]=aux;
poz[h[p1]]=p1;
poz[h[p2]]=p2;
}
void urca(int p)
{
while (p>1 && v[h[p]]< v[h[p/2]])
{
schimb (p,p/2);
p/=2;
}
}
void coboara (int p)
{
int fs=2*p,fd=2*p+1,bun=p;
if (fs<=nh && v[h[fs]]<v[h[bun]]) bun=fs;
if (fd<=nh && v[h[fd]]<v[h[bun]]) bun=fd;
if (bun!=p)
{
schimb (bun,p);
coboara(bun);
}
}
void stergeH (int p)
{
schimb (p,nh--);
urca(p);
coboara(p);
}
void adauga (int x)
{
h[++nh]=x;
poz[x]=nh;
urca(nh);
}
void afisare ()
{
for (int i=1;i<=nh;i++)
fprintf (out,"%d ",v[h[i]]);
fprintf (out,"\n");
}
void citire ()
{
fscanf (in,"%d",&n);
int nr = 0;
for (int i=1; i<=n; i++)
{
int y;
fscanf (in,"%d",&y);
if (y==1)
{
fscanf (in,"%d",&v[++nr]);
adauga(nr);
//fprintf (out,"%d->",i);
//afisare ();
}
if (y==2)
{
int x;
fscanf (in,"%d",&x);
stergeH(poz[x]);
// fprintf (out,"%d->",i);
//afisare ();
}
if (y==3)
fprintf (out,"%d\n",v[h[1]]);
}
}
int main()
{
citire();
return 0;
}