leetcode

0 class Solution {

1 public:

2 int matrixSum(const vector<vector<int>> &nums) const {

3 static int maxi[501];

4 memset(maxi, 0x00, sizeof(maxi));

5

6 const int m = nums[0].size();

7 for (auto row : nums) {

8 sort(row.begin(), row.end());

9 for (int i = 0; i < m; i++)

10 maxi[i] = max(maxi[i], row[i]);

11 }

12

13 return accumulate(begin(maxi), begin(maxi) + m, 0);

14 }

15 };