Pagini recente » Cod sursa (job #1052458) | Cod sursa (job #1345178) | Cod sursa (job #1213349) | Cod sursa (job #3236161) | Cod sursa (job #1979467)
#include <iostream>
#include<cstdio>
using namespace std;
int h[200001];
int v[200001];
int poz[200001];
int nh,nrad;
void schimba (int p,int q){
int aux=h[p];
h[p]=h[q];
h[q]=aux;
poz[h[p]]=p;
poz[h[q]]=q;
}
void urca(int p){
if(p>1 && v[h[p]]<v[h[p/2]]){
schimba(p,p/2);
urca(p/2);
}
}
void coborare(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){
schimba(p,bun);
coborare(bun);
}
}
void sterge(int p){
schimba(p,nh);
nh--;
urca(p);
coborare(p);
}
void adauga(int x){
h[++nh]=x;
poz[x]=nh;
urca(nh);
}
int main()
{
int n,i,tip,a;
FILE*fin,*fout;
fin=fopen("heapuri.in","r");
fout=fopen("heapuri.out","w");
fscanf(fin,"%d",&n);
for(i=1;i<=n;i++){
fscanf(fin,"%d",&tip);
if(tip==1){
fscanf(fin,"%d",&v[++nrad]);
adauga(nrad);
}
if(tip==2){
fscanf(fin,"%d",&a);
sterge(poz[a]);
}
if(tip==3){
fprintf(fout,"%d\n",v[h[1]]);
}
}
return 0;
}