This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |