Найти номер строки матрицы, для которой среднеарифметическое значение ее элементов наименьшее

minn=1;
for j:=1 to n do mins:=mins+sum[j,1];
mins:=mins/n;
for i:=2 to m do begin
sum:=0;
for j:=1 to n do sum:=sum+x[j,i];
if mins>sum/n then begin
mins:=sum/n;
minn:=i;
end;
end;
writeln('среднее арифметичекое наименьшее в ',minn,'-й строке');

program day4;
uses CRT;
var a:array[1..10,1..10] of integer;
m,i,j,sum,minn,mins:integer;
n:byte;
begin
clrscr;
write('ўўҐ¤ЁвҐ Є®«ЁзҐбвў® бва®Є');
readln(n);
write('ўўҐ¤ЁвҐ Є®«ЁзҐбвў® бв®«Ўж®ў');
readln(m);
for i:=1 to m do
begin
for j:=1 to n do
read(a[i,j]);
end;
writeln('‚ўҐ¤Ґ*л© ¬*ббЁў:');
for i:=1 to m do
begin
for j:=1 to n do
write(a[i,j]:5);
end;
begin
minn:=1;
for j:=1 to n do
mins:=mins+a[j,1];
mins:=mins/n;
for i:=2 to do sum:=x[j,i];
if mins>sum/n then begin
mins:=sum/n;
minn:=i;
end;
end;
writeln('sred v ',minn,'-i stroke');
readkey;
end.

var a:array[1..5,1..5] of integer;
m,i,j,sum,minn,mins:integer;
n:byte;
begin
m:=5;
n:=5;
for i:=1 to m do
for j:=1 to n do
begin
write('vvedite element[',i,',',j,'] ');
readln(a[i,j]);
end;
 
for i:=1 to m do
begin
writeln;
for j:=1 to n do
begin
write(a[i,j]:5);
end;
end;
writeln;
minn:=1;
for j:=1 to n do mins:=mins+a[j,1];
mins:=round(mins/n);
for i:=2 to m do begin
sum:=0;
for j:=1 to n do sum:=sum+a[j,i];
if mins>sum/n then begin
mins:=round(sum/n);
minn:=i;
end;
end;
writeln;
writeln('srednee arifmeticheskoe minimalno v ',minn,'-y stroke');
readln;
end.

USES CRT;
var a:array[1..100,1..100] of integer;
   m,i,j,sum,n,k,sum:integer;
   srmin:real;
begin
writeln('m,n ');
readln(m,n);
 
for i:=1 to m do
for j:=1 to n do
readln(a[i,j]);
 
 
for i:=1 to m do
begin
writeln;
for j:=1 to n do
begin
write(a[i,j]:5);
end;
end;
writeln;
i:=1;
 for j:=1 to n do
  sum:=sum+a[i,j];
srmin:=sum/n;
k:=1;
 
for i:=2 to m do 
  begin
   sum:=0;
   for j:=1 to n do
     sum:=sum+a[i,j];
   if sum/n<srsum then
              begin
                srsum:=sum/n;
                k:=i;
              end;
  end;
writeln(k,' - stroka ');
readln;
end.