快排出问题了

program kuaipai;

const maxn=10000;

var

n,i:longint;

b:array[1..maxn] of longint;

procedure qs(s,t:longint);

var r,i,j,x,y:longint;

a:array[1..10000] of longint;

begin

i:=s;

j:=t;

x:=a[(i+j)shr i];

repeat

while a[i]>x do inc(i);

while a[j]