题解 | #矩阵计算#

#include <iostream>

using namespace std;

int main()
{
    int m, n;
    cin >> n >> m;  //n行m列
    int sum = 0;
    int arr[10][10] = { 0 };
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            cin >> arr[i][j];
        }
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (arr[i][j] > 0)
            {
                sum += arr[i][j];
            }
        }
    }
    cout << sum << endl;
}