CONST NUM = 10000; var Ar : array [1..NUM] of word; i,j,tmp,Med : word; procedure QSort(l,r:word); begin if (r-l) <= 1 then begin if ar[l] < ar[r] then begin tmp := Ar[l]; Ar[l] := Ar[r]; Ar[r] := Tmp; end; exit; end; i := l; j := r; Med := Ar [(l+r) div 2]; while j>=i do begin while (Ar[i]>Med) and (il) do dec(j); if (i<=j) then begin Tmp := Ar[i]; Ar[i] := Ar[j]; Ar[j] := Tmp; inc(i);dec(j); end; end; if (j>l) then Qsort(l,j); if (i