program test2;

const
  TEST_SIZE = 50000;

type
  TValue = integer;
  TIndexArray = array of integer;
var
  Arr: array of TValue;


  procedure Init;
  var
    i: integer;
    tmp: TValue;
    r: integer;
  begin
    for i := 0 to TEST_SIZE - 1 do
      arr[i] := i;
    // Перемешиваем
    r := 54323; // ГСЧ с постоянной последовательстью
    for i := 0 to TEST_SIZE - 1 do
    begin
      repeat
        r := (r * 12347 + 1) mod TEST_SIZE;
      until (r >= 0);

      tmp := arr[i];
      arr[i] := arr[r];
      arr[r] := tmp;
    end;
  end;

  procedure QuickSort(FList: PInteger; L, R: longint);

    function Compare(a, b: integer): integer;
    begin
      Result := Arr[a] - Arr[b];
    end;

  var
    I, J: longint;
    P, Q: integer;
  begin
    repeat
      I := L;
      J := R;
      P := FList[(L + R) div 2];
      repeat
        while Compare(P, FList[i]) > 0 do
          I := I + 1;
        while Compare(P, FList[J]) < 0 do
          J := J - 1;
        if I <= J then
        begin
          Q := FList[I];
          Flist[I] := FList[J];
          FList[J] := Q;
          I := I + 1;
          J := J - 1;
        end;
      until I > J;
      // sort the smaller range recursively
      // sort the bigger range via the loop
      // Reasons: memory usage is O(log(n)) instead of O(n) and loop is faster than recursion
      if J - L < R - I then
      begin
        if L < J then
          QuickSort(FList, L, J);
        L := I;
      end
      else
      begin
        if I < R then
          QuickSort(FList, I, R);
        R := J;
      end;
    until L >= R;
  end;

  procedure SearchIndexes(var m: TIndexArray);
  var
    i: integer;
  begin
    for i := 0 to TEST_SIZE - 1 do
      m[i] := i;
    QuickSort(@m[0], 0, TEST_SIZE - 1);

  end;

var
  m: TIndexArray;
begin
  SetLength(Arr, TEST_SIZE);
  Init;
  SetLength(m, TEST_SIZE);
  SearchIndexes(m);
  for i:=0 to 6 do
  begin
    Writeln('Element:',Arr[m[i]], '  position:',m[i],
    '  smaller count:', i,'  greater count:', TEST_SIZE-i-1);
  end;    
end.