#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const long long INF=1e18;
int n,m;
long long dp[1005][1005];
long long a[1005];
long long b[1005];
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=m;i++) cin>>b[i];
dp[1][1]=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(i>1 || j>1) dp[i][j]=INF;
if(i>1) dp[i][j]=min(dp[i][j], dp[i-1][j]+b[j]);
if(j>1) dp[i][j]=min(dp[i][j], dp[i][j-1]+a[i]);
}
}
cout<<dp[n][m]<<endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
724 KB |
Output is correct |
5 |
Correct |
7 ms |
2260 KB |
Output is correct |
6 |
Correct |
1 ms |
1620 KB |
Output is correct |
7 |
Correct |
1 ms |
1108 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
7 ms |
8148 KB |
Output is correct |
10 |
Correct |
7 ms |
8148 KB |
Output is correct |
11 |
Correct |
6 ms |
8148 KB |
Output is correct |
12 |
Correct |
6 ms |
8148 KB |
Output is correct |
13 |
Correct |
8 ms |
8148 KB |
Output is correct |
14 |
Correct |
8 ms |
8148 KB |
Output is correct |
15 |
Correct |
8 ms |
8148 KB |
Output is correct |
16 |
Correct |
7 ms |
8136 KB |
Output is correct |
17 |
Correct |
7 ms |
8148 KB |
Output is correct |
18 |
Correct |
0 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
0 ms |
340 KB |
Output is correct |
22 |
Correct |
0 ms |
212 KB |
Output is correct |
23 |
Correct |
0 ms |
340 KB |
Output is correct |
24 |
Correct |
0 ms |
340 KB |
Output is correct |
25 |
Correct |
0 ms |
340 KB |
Output is correct |
26 |
Correct |
1 ms |
340 KB |
Output is correct |
27 |
Correct |
0 ms |
340 KB |
Output is correct |
28 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Incorrect |
3 ms |
2700 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
0 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
724 KB |
Output is correct |
5 |
Correct |
7 ms |
2260 KB |
Output is correct |
6 |
Correct |
1 ms |
1620 KB |
Output is correct |
7 |
Correct |
1 ms |
1108 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
7 ms |
8148 KB |
Output is correct |
10 |
Correct |
7 ms |
8148 KB |
Output is correct |
11 |
Correct |
6 ms |
8148 KB |
Output is correct |
12 |
Correct |
6 ms |
8148 KB |
Output is correct |
13 |
Correct |
8 ms |
8148 KB |
Output is correct |
14 |
Correct |
8 ms |
8148 KB |
Output is correct |
15 |
Correct |
8 ms |
8148 KB |
Output is correct |
16 |
Correct |
7 ms |
8136 KB |
Output is correct |
17 |
Correct |
7 ms |
8148 KB |
Output is correct |
18 |
Correct |
0 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
0 ms |
340 KB |
Output is correct |
22 |
Correct |
0 ms |
212 KB |
Output is correct |
23 |
Correct |
0 ms |
340 KB |
Output is correct |
24 |
Correct |
0 ms |
340 KB |
Output is correct |
25 |
Correct |
0 ms |
340 KB |
Output is correct |
26 |
Correct |
1 ms |
340 KB |
Output is correct |
27 |
Correct |
0 ms |
340 KB |
Output is correct |
28 |
Correct |
0 ms |
340 KB |
Output is correct |
29 |
Correct |
0 ms |
212 KB |
Output is correct |
30 |
Correct |
0 ms |
340 KB |
Output is correct |
31 |
Incorrect |
3 ms |
2700 KB |
Output isn't correct |
32 |
Halted |
0 ms |
0 KB |
- |