题解

#include<bits/stdc++.h>
using namespace std;

int cost[120][120];
int dp[120][120];
int main(){
    int n;
    cin >> n;
    for (int i = 1;i <= n;i ++){
        for (int j = 1;j <= n;j ++){
            cin >> cost[i][j];
        }
    }
    dp[1][1] = cost[1][1];
    for (int i = 2;i <= n;i ++){
        dp[i][1] = dp[i - 1][1] + cost[i][1];
    }
    for (int i = 2;i <= n;i ++){
        dp[1][i] = dp[1][i - 1] + cost[1][i];
    }
    for (int i = 2; i <= n;i ++) {
        for (int j = 2; j <= n;j ++) {
            dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + cost[i][j];
        }
    }
    cout << dp[n][n] << endl;
}