cherepaha

#include <iostream>
#include <vector>
using namespace std;
int main() {
    int n, k;
    cin >> n >> k;
    int a[n][k];
    int dp[n][k];
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < k; j++) {
            cin >> a[i][j];
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < k; j++) {
            if (i==0 and j==0) dp[i][j]=a[0][0];
            else if (i==0) dp[0][j]=dp[0][j-1]+a[0][j];
            else if (j==0) dp[i][0]=dp[i-1][0]+a[i][0];
            else dp[i][j]=min(dp[i-1][j], dp[i][j-1])+a[i][j];
        }
    } cout << dp[n-1][k-1];
}