제출 #783221

#제출 시각아이디문제언어결과실행 시간메모리
783221Dan4LifeSightseeing in Kyoto (JOI22_kyoto)C++17
10 / 100
14 ms8332 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxN = (int)1e3+10;
int n, m;
int dp[mxN][mxN];
int a[100010], b[100010];

int32_t main()
{
	cin >> n >> m;
	for(int i = 0; i < n; i++) cin >> a[i];
	for(int i = 0; i < m; i++) cin >> b[i];
	memset(dp,63,sizeof(dp)); dp[1][1] = 0;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			if(i>1) dp[i][j] = min(dp[i][j], dp[i-1][j]+b[j-1]);
			if(j>1) dp[i][j] = min(dp[i][j], dp[i][j-1]+a[i-1]);
		}
	}
	cout << dp[n][m];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...