120

class Solution {
public:
    int minimumTotal(vector<vector<int>>& triangle) {
        for(int i=1; i<triangle.size(); i++){
            for(int j=0; j<triangle[i].size(); j++){
                triangle[i][j] += min(triangle[i-1][max(0, j-1)], triangle[i-1][min(j, int(triangle[i-1].size()-1))]);
            }
        }
        int ans = INT_MAX;
        for(int i=0; i<triangle[triangle.size()-1].size(); i++)
            ans = min(ans, triangle[triangle.size()-1][i]);
        return ans;
    }
};