Pagini recente » Cod sursa (job #1500027) | Cod sursa (job #637060) | Cod sursa (job #385948) | Cod sursa (job #1834744) | Cod sursa (job #1239764)
#include <fstream>
using namespace std;
int a,b,h[10000000],i,j,k,ord[10000000],fake[10000000],nr;
long n;
ifstream f("heapuri.in");
ofstream g("heapuri.out");
void swap(int i,int j)
{int aux;
aux=h[i];
h[i]=h[j];
h[j]=aux;
fake[ord[i]]=j;
fake[ord[j]]=i;
aux=ord[i];
ord[i]=ord[j];
ord[j]=aux;
}
void heapup(int poz)
{int i;
i=poz/2;
if (h[poz]<h[i])
{swap(poz,i);
heapup(i);
}
}
void heapdown(int i,int k)
{int poz;
if (2*i>k) return;
if (2*i+1<=k)
{if (h[2*i+1]>h[2*i]) poz=2*i+1;
else poz=2*i;
}
else poz=2*i;
if (h[i]>h[poz])
{swap(i,poz);
heapdown(poz,k);}
}
int main()
{f>>n;
for (i=1;i<=n;i++)
{f>>a;
if(a!=3) f>>b;
if (a==1) {k++;
ord[k]=k;
fake[k]=k;
h[k]=b;
heapup(k);
}
if(a==2){
swap(fake[b],k);
k--;
nr++;
heapdown(ord[b],k);
}
if (a==3) g<<h[1]<<'\n';
}
}