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 int long long
using namespace std;
signed main(){
int n,m;
cin>>n>>m;
vector<int> a(n),b(m);
vector<vector<int>> dp(n,vector<int>(m));
for(int &i:a) cin>>i;
for(int &i:b) cin>>i;
for(int i=1;i<n;i++){
dp[i][0]=dp[i-1][0]+b[0];
}
for(int i=1;i<m;i++){
dp[0][i]=dp[0][i-1]+a[0];
}
for(int i=1;i<n;i++){
for(int j=1;j<m;j++){
dp[i][j]=min(dp[i-1][j]+b[j],dp[i][j-1]+a[i]);
}
}
cout<<dp[n-1][m-1]<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |