Упорядочить элементы по убыванию во втором столбце матрицы b[1..n,1..n] — Pascal(Паскаль)

uses crt;
const n=6;
var b:array[1..n,1..n] of integer;
    i,j,k,x:integer;
begin
ClrScr;
Randomize;
for i:=1 to n do
 begin
  for j:=1 to n do
   begin
    b[i,j]:=random(20)-10;
    Write(b[i,j]:4);
   end;
  Writeln;
 end;
Writeln;
for i:=1 to n do
 for j:=1 to n do
  for k:=j to n do
   if b[i,2]<b[k,2] then
    begin
     x:=b[i,2];
     b[i,2]:=b[k,2];
     b[k,2]:=x;
    end;
Writeln;
for i:=1 to n do
 begin
  for j:=1 to n do
   Write(b[i,j]:4);
  Writeln;
 end;
Readln;
end.