program matrica;
uses crt;
type
    arrsort= array[0..100,1..100] of integer;{100 элементов в строке и столбце думаю хватит}
var 
 matr : arrsort;
 n,m : integer;{размеры матрицы}
 S : real;

Procedure CreateMatr(var matr :arrsort;n,m : integer);
var
 i,j : integer; 
begin
  for i:=1 to n do begin
   for j:=1 to m do begin
    matr[i,j]:=random(100);
    write(matr[i,j],' ');
  end;
  writeln;
 end;
end;

Procedure FindMiddle(var matr :arrsort;n,m : integer;Var S : real);
var
 i,j : integer; 
begin
S:=0;
  for i:=1 to n do
   for j:=1 to m do
    S:=S+matr[i,j];{суммируем все элементы матрицы}

 S:=S/(n*m);{Находим среднее арифметическое}
  
end;

Procedure FindElem(var matr :arrsort;n,m : integer; S : real);
var
 i : integer; 
begin
 if n<=m then
  begin
  write('Элементы больше среднего:');
  for i:=1 to n do
    if matr[i,i]>S then
      write(matr[i,i],' ');
  end
 else
  begin
  write('Элементы больше среднего:');
  for i:=1 to m do
    if matr[i,i]>S then
      write(matr[i,i],' ');
  end;
end;

begin
randomize;
write('Введите размеры матрицы');
read(n,m);
CreateMatr(matr,n,m);
FindMiddle(matr,n,m,S);
FindElem(matr,n,m,S);
readkey;
end.

 if n<=m then
  begin
  write('Элементы больше среднего:');
  for i:=1 to n do
    if matr[i,i]>S then
      write(matr[i,i],' ');
  end
 else
  begin
  write('Элементы больше среднего:');
  for i:=1 to m do
    if matr[i,i]>S then
      write(matr[i,i],' ');
  end;

const
  n = 10;
  m = 10;

type
  arrtype = array[1 .. n, 1 .. m] of integer;
  vectype = array[1 .. m - 1] of integer;

procedure sort(const arr: vectype; var ix: vectype; n: integer);
var i, j, T: integer;
begin
  for i := 1 to n do
    for j := n downto i + 1 Do
      if arr[ix[j - 1]] < arr[ix[j]] then begin
        T := ix[j - 1]; ix[j - 1] := ix[j]; ix[j] := T
      end;
end;

var
  arr: arrtype;
  mins, index: vectype;
  i, j, min: integer;

begin
  for i := 1 to n do begin
    for j := 1 to m do begin
      arr[i, j] := random(100);
      write(arr[i, j]:4);
    end;
    writeln;
  end;

  writeln; writeln;

  for j := 1 to m - 1 do begin
    min := maxint;
    for i := 1 to (n - j) do begin
      if min > arr[i, j] then min := arr[i, j];
    end;
    mins[j] := min; index[j] := j;
  end;

  sort(mins, index, m - 1);
  for i := 1 to m - 1 do begin
    write(mins[index[i]], '(', index[i], ') ');
  end;

end.