Pagini recente » Profil ReksioCroft | Borderou de evaluare (job #2640580) | Borderou de evaluare (job #1296976) | Borderou de evaluare (job #2264399) | Cod sursa (job #1319087)
#include<fstream>
using namespace std;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
struct pct
{
int v,p;
}h[200005];
int poz[200005],nr=0,c,n,x;
void upheap(int k)
{
if(k==1||h[k/2].v<h[k].v)
return;
poz[h[k].p]=k/2;
poz[h[k/2].p]=k;
pct aux=h[k];
h[k]=h[k/2];
h[k/2]=aux;
upheap(k/2);
}
void downheap(int k)
{
if(k*2>nr||(h[k*2].v>=h[k].v&&h[k*2+1].v>=h[k].v))
return;
pct aux;
if(h[k*2].v<h[k*2+1].v)
{
poz[h[k*2].p]=k;
poz[h[k].p]=k*2;
aux=h[k*2];
h[k*2]=h[k];
h[k]=aux;
downheap(k*2);
}
else
{
poz[h[k*2+1].p]=k;
poz[h[k].p]=k*2+1;
aux=h[k*2+1];
h[k*2+1]=h[k];
h[k]=aux;
downheap(k*2+1);
}
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>c;
if(c==1)
{
nr++;
f>>h[nr].v;h[nr].p=nr;poz[nr]=nr;
upheap(nr);
}
if(c==2)
{
f>>x;
h[poz[x]]=h[nr];
nr--;
upheap(poz[x]);
downheap(poz[x]);
}
if(c==3)
g<<h[1].v<<"\n";
}
f.close();g.close();
return 0;
}