小跟堆维护排序

这是堆排序中较常见的一种。具体操作如下:

1.建堆

2.取根节点

3.维护堆

代码如下：

var
        a:array[0..200001]of longint;
        n,i,t,m:longint;
procedure up(x:longint);
var
        i:longint;
begin
        i:=x;
        while (a[i div 2]>a[i]) do
        begin
                t:=a[i div 2];
                a[i div 2]:=a[i];
                a[i]:=t;
                i:=i div 2;
        end;
end;
procedure down(x:longint);
var
        i,j:longint;
begin
        i:=x;
        while (i*2<=n)and(a[i]>a[i*2])or(i*2+1<=n)and(a[i]>a[i*2+1]) do
        begin
                j:=i*2;
                if (j+1<=n)and(a[j+1]<a[j]) then inc(j);
                t:=a[i];
                a[i]:=a[j];
                a[j]:=t;
                i:=j;
        end;
end;
begin
        assign(input,'dui.in');reset(input);
        assign(output,'dui.out');rewrite(output);
        readln(n);
        m:=n;
        for i:=1 to n do read(a[i]);
        for i:=n div 2 to n do up(i);//建堆
        repeat
                t:=a[1];
                a[1]:=a[n];
                a[n]:=t;       //取根节点
                dec(n);
                down(1);       //维护堆
                writeln(a[n+1]);
        until n=0;                
        close(input);close(output);
end.