class Solution {

 public:

     int minPathSum(vector<vector<int>>& grid) {

         int m=grid.size(),n=grid[].size();

         int dp[m][n];

         dp[][]=grid[][];

         for(int i=;i<m;i++){

             dp[i][]=dp[i-][]+grid[i][];

         }

         for(int j=;j<n;j++){

             dp[][j]=dp[][j-]+grid[][j];

         }

         for(int i=;i<m;i++){

             for(int j=;j<n;j++){

                 dp[i][j]=min(dp[i-][j],dp[i][j-])+grid[i][j];

             }

         }

         return dp[m-][n-];

     }

 };