Pagini recente » Cod sursa (job #3340756) | Cod sursa (job #3340753) | Cod sursa (job #1168630) | Borderou de evaluare (job #1168769) | Cod sursa (job #1168751)
program heap;
var H,poz_heap,poz_intr : array [1..2000000] of longint;
k,i,n,a,b,t,j,l,prim,ultim,nod,aux: longint;
b1,b2 : array[0..1 shl 17] of char;
procedure swap(var x,y : longint);
var aux : longint;
begin
aux:=x;
x:=y;
y:=aux;
end;
procedure coboara(k : longint);
var fiu : longint;
begin
repeat
fiu:=0;
if k*2<=n then
begin
fiu:=k*2;
if (k*2<n) and (H[k*2+1]<H[k*2]) then fiu:=k*2+1;
if H[fiu]>=H[k] then fiu:=0
end;
if fiu<>0 then begin
swap(H[k],H[fiu]);
swap(poz_heap[H[k]],poz_heap[H[fiu]]);
k:=fiu;
end;
until fiu=0;
end;
procedure ridica(k : longint);
var aux: longint;
begin
aux:=H[k];
while (k>1) and (aux<H[k div 2]) do begin
swap(H[k],H[k div 2]);
swap(poz_heap[H[k]],poz_heap[H[k div 2]]);
k:=k div 2;
end;
H[k]:=aux;
end;
procedure sterge(var n : longint ; k : longint);
begin
H[k]:=H[n];
swap(poz_heap[H[n]],poz_heap[H[k]]);
n:=n-1;
if (k<>1) and (H[k]<H[k div 2]) then ridica(k)
else coboara(k);
end;
procedure inserare(var n,l : longint; k : longint) ;
begin
n:=n+1;
H[n]:=k;
poz_heap[k]:=n;
l:=l+1;
poz_intr[l]:=k;
ridica(n);
end;
begin
assign(input,'heapuri.in'); settextbuf(input,b1);reset(input);
assign(output,'heapuri.out'); settextbuf(output,b2);rewrite(output);
readln(t);
for k:=1 to t do begin
read(a);
if a=3 then writeln(H[1])
else
if a=2 then begin
readln(b);
sterge(n,poz_heap[poz_intr[b]]);
end
else
if a=1 then begin
readln(b);
inserare(n,l,b);
end;
end;
close(input);
close(output);
end.