class Solution {
public:
int minPathSum(vector<vector<int>>& grid) {
int m=grid.size();
int n=grid[0].size();
vector<vector<int>> g(m,vector<int>(n,0));
g[0][0]=grid[0][0];
for(int i=1;i<n;i++)
g[0][i]=grid[0][i]+g[0][i-1];
for(int i=1;i<m;i++)
g[i][0]=grid[i][0]+g[i-1][0];
for(int i=1;i<m;i++)
for(int j=1;j<n;j++)
g[i][j]=min(g[i-1][j],g[i][j-1])+grid[i][j];
return g[m-1][n-1];
}
};