[Pascal] задача с массивами

[MaximV]

В матрице [7,7] определить номер строки,сумма элементов который наибольшая.

[GreenWizard]

var
  T: array[1..7, 1..7] of Double;
  Sum, MaxS: Double;
  i, j, MaxSIndex: Integer;
begin
  for i := 1 to 7 do
    for j := 1 to 7 do
      begin
        Write('T[', i, ', ', j, '] = ');
        Readln(T[i, j]);
      end;

  Writeln;

  for i := 1 to 7 do
    begin
      for j := 1 to 7 do
        Write(T[i, j]: 3: 3, #9);
      Writeln;
    end;
  Writeln;

  MaxS := -1;
  MaxSIndex := -1;
  for i := 1 to 7 do
    begin
      Sum := 0;
      for j := 1 to 7 do
        Sum := Sum + T[i, j];

      if (Sum > MaxS) or (MaxSIndex < 1) then
        begin
          MaxS := Sum;
          MaxSIndex := i;
        end;
    end;

  Writeln('Max summ in ', MaxSIndex, ' row');
  Readln;
end.