Pagini recente » Cod sursa (job #1147403) | Cod sursa (job #1769476) | Cod sursa (job #315533) | Cod sursa (job #2987051) | Cod sursa (job #1042677)
#include<cstdio>
#include<cstring>
using namespace std;
struct elem
{
int x,y;
} a[200005];
int m,n,t,x,nr,w[200005];
void interschimba(int poz1, int poz2)
{
elem aux=a[poz1]; a[poz1]=a[poz2], a[poz2]=aux;
w[a[poz1].y]=poz1, w[a[poz2].y]=poz2;
}
void reconstituie_heap(int s, int lung)
{
int minim=s;
if (2*s<=lung && a[minim].x>a[2*s].x) minim=2*s;
if (2*s+1<=lung && a[minim].x>a[2*s+1].x) minim=2*s+1;
if (minim!=s)
{
interschimba(s,minim);
reconstituie_heap(minim,lung);
}
}
void construieste_heap(int lung)
{
int i;
for (i=lung/2;i;--i)
reconstituie_heap(i,lung);
}
int main()
{
int i;
freopen("heapuri.in","r",stdin);
freopen("heapuri.out","w",stdout);
scanf("%d",&m);
for (i=0;i<m;++i)
{
scanf("%d",&t);
if (t==3)
{
construieste_heap(n);
printf("%d\n",a[1].x);
}
else
{
scanf("%d",&x);
if (t==1)
{
a[++n].x=x, a[n].y=++nr, w[nr]=n;
}
else
{
interschimba(w[x],n);
--n;
}
}
}
return 0;
}