64

class Solution {
public:
    int minPathSum(vector<vector<int>>& grid) {
        int rows = grid.size(), cols = grid[0].size();
        for(int i=0; i<rows; i++){
            for(int j=0; j<cols; j++){
                int minSum = INT_MAX;
                minSum = (i>0) ? min(grid[i-1][j], minSum) : minSum;
                minSum = (j>0) ? min(grid[i][j-1], minSum) : minSum;
                grid[i][j] += ((minSum == INT_MAX) ? 0 : minSum);
            }
        }
        return grid[rows-1][cols-1];
    }
};