if (grid.size()<=0){

return 0;

}

int i, j;

for(i=0; i<grid.size(); i++){

for(j=0; j<grid[i].size(); j++){

int top = i-1<0 ? INT_MAX : grid[i-1][j] ;

int left = j-1<0 ? INT_MAX : grid[i][j-1];

if (top==INT_MAX && left==INT_MAX){

continue;

}

grid[i][j] += (top < left? top: left);

}

}

return grid[grid.size()-1][grid[0].size()-1];

{

int a[6][2]={{7,2},{6,6},{8,6},{8,7},{5,0},{6,0}};

vector< vector<int> > grid;

for(int i=0; i<6; i++){

vector<int> v;

for(int j=0; j<2; j++){

v.push_back(a[i][j]);

}

grid.push_back(v);

}

cout << "minPathSum=" << minPathSum(grid) << endl;

return 0;