Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- program Project2;
- {$APPTYPE CONSOLE}
- uses
- SysUtils;
- const
- MAXIN = 1000;
- var
- i, j, m, n, k, min, mini, minj, min1, mini1, minj1: Integer;
- a: array [0..MAXIN, 0..MAXIN] of integer;
- dp, dp1: array [0..MAXIN, 0..MAXIN] of int64;
- sumr, sumstr: array [1..MAXIN] of int64;
- function findr(n1, n: integer): int64;
- var
- sum: int64;
- i: integer;
- begin
- sum := 0;
- for i := 1 to n do
- sum := sum + a[n1][i];
- findr := sum;
- end;
- function findstr(n1, m: integer): int64;
- var
- sum: int64;
- j: integer;
- begin
- sum := 0;
- for j := 1 to m do
- sum := sum + a[j][n1];
- findstr := sum;
- end;
- begin
- assign(input,'input.txt');
- reset(input);
- assign(output,'output.txt');
- rewrite(output);
- read(n, m);
- for i := 1 to n do
- for j := 1 to m do
- Read(a[i][j]);
- for i := 1 to n do
- sumr[i] := findr(i, n);
- for j := 1 to m do
- sumstr[j] := findstr(j, m);
- for i := 1 to n do
- begin
- for j := 1 to m do
- begin
- dp1[i][j] := sumr[i] + sumstr[j] - a[i][j];
- end;
- end;
- Min1 := dp1[1][1];
- mini1 := 1;
- minj1 := 1;
- for i := 1 to n do
- for j := 1 to m do
- if (dp1[i][j] < min1) then
- begin
- Min1 := dp1[i][j];
- mini1 := i;
- minj1 := j;
- end;
- Writeln(mini1 - 1, ' ',minj1 - 1);
- Readln;
- readln;
- close(input);
- close(output);
- end.
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement