PROG-1114: กระโดดสูง (HighJ)

#include <bits/stdc++.h>

using namespace std;
const int INF = 1e9;
const int N = 610;
int ar[N][N], dp[N];

int main(){

    int n, nn;
    scanf("%d", &n);
    nn = 2 * n;

    for(int i=1;i<=nn;i++){
        dp[i] = INF;
        for(int j=1;j<=nn;j++){
            scanf("%d", &ar[i][j]);
        }
    }

    dp[2] = 0; /// [1][1]
    for(int i=1;i<=nn;i++){
        for(int j=1;j<i;j++){
            dp[i] = min(dp[i], ar[i][j] + dp[j]);
        }
    }

    printf("%d", dp[nn]);

    return 0;
}