leetcode807

class Solution {
public:
    int maxIncreaseKeepingSkyline(vector<vector<int>>& grid) {
        int r[grid.size()] = {0};
        int c[grid[0].size()] = {0};
        int ans = 0;
        //r
        for(int i = 0;i<grid.size();i++)
        {
            int tmp = 0;
            for(int j = 0;j<grid[0].size();j++)
            {
                tmp = max(tmp,grid[i][j]);
            }
            r[i] = tmp;
        }
        //c
        for(int j = 0;j<grid[0].size();j++)
        {
            int tmp = 0;
            for(int i = 0;i<grid.size();i++)
            {
                tmp = max(tmp,grid[i][j]);
            }
            c[j] = tmp;
        }
        
        for(int i = 0;i<grid.size();i++)
        {
            for(int j = 0;j<grid[0].size();j++)
            {
                if(grid[i][j]<max(r[i],c[j]))
                {
                    ans += min(r[i],c[j]) - grid[i][j];
                }
            }
        }
        
        return ans;
    }
};