Pascal ABC Написание программы Заполнить двумерный массив А (MхN) элементов числами из текстового файла. Каждую строку массива А упорядочить по убыванию пересчетом в соответствующую строку массива В (MxN).
var fileInput: Text; A, B: array [1..10, 1..10] of integer; M, N, i, j, k, temp: integer;
begin assign(fileInput, 'input.txt'); reset(fileInput);
readln(fileInput, M, N);
for i := 1 to M do begin for j := 1 to N do begin read(fileInput, A[i, j]); B[i, j] := A[i, j]; end; readln(fileInput); end;
close(fileInput);
for i := 1 to M do begin for j := 1 to N - 1 do begin for k := 1 to N - j do begin if B[i, k] < B[i, k+1] then begin temp := B[i, k]; B[i, k] := B[i, k+1]; B[i, k+1] := temp; end; end; end; end;
for i := 1 to M do begin for j := 1 to N do begin write(B[i, j], ' '); end; writeln; end;
program FillAndSortArray;
var
fileInput: Text;
A, B: array [1..10, 1..10] of integer;
M, N, i, j, k, temp: integer;
begin
assign(fileInput, 'input.txt');
reset(fileInput);
readln(fileInput, M, N);
for i := 1 to M do
begin
for j := 1 to N do
begin
read(fileInput, A[i, j]);
B[i, j] := A[i, j];
end;
readln(fileInput);
end;
close(fileInput);
for i := 1 to M do
begin
for j := 1 to N - 1 do
begin
for k := 1 to N - j do
begin
if B[i, k] < B[i, k+1] then
begin
temp := B[i, k];
B[i, k] := B[i, k+1];
B[i, k+1] := temp;
end;
end;
end;
end;
for i := 1 to M do
begin
for j := 1 to N do
begin
write(B[i, j], ' ');
end;
writeln;
end;
end.