Problem: 2500. 删除每行中的最大值

思路

easy

解题方法

easy~

Code

class Solution {
public:
    int deleteGreatestValue(vector<vector<int>>& grid) {
        int n = grid.size();
        int m = grid[0].size();

        int ans = 0;
        for (int i = 0; i < n; i++) sort(grid[i].begin(), grid[i].end());
        for (int i = 0; i < m; i++) {
            int tmp = -1;
            for (int j = 0; j < n; j++) {
                tmp = max(tmp, grid[j][m-i-1]);
            }
            ans += tmp;
        }

        return ans;
    }
};