题解 | #矩阵最大值#

#include <iostream>
using namespace std;

int main() {
    int m, n, i, j;
    while (cin >> m >> n) {
        int nums[m][n];
        int row_max, max_j, row_sum;
        for (i = 0; i < m; i++) {
            for (j = 0; j < n; j++) {
                cin >> nums[i][j];
            }
        }
        for (i = 0; i < m; i++) {
            row_max = 0, row_sum = 0;
            for (j = 0; j < n; j++) {
                if (nums[i][j] > row_max) {
                    max_j = j;
                    row_max = nums[i][j];
                }
                row_sum += nums[i][j];
            }
            nums[i][max_j] = row_sum;//把每行总和放入每行最大值的位置
        }
        for (i = 0; i < m; i++) {
            for (j = 0; j < n; j++) {
                cout << nums[i][j]<<' ';
            }
            cout<<endl;
        }
    }
}