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>
using namespace std;
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define vll vector<long long>
#define MOD 1000000007
#define endl '\n'
typedef long long ll;
void print(vi v){
cout<<"Contents of vector:\n";
for(auto x : v) cout<<x<<" ";
cout<<endl<<endl;
}
void solve(){
int m, n; cin>>m>>n;
int l[m+n-1], r[m+n-1];
for(int i = 0; i<m+n-1; i++) cin>>l[i];
for(int i = 0; i<m+n-1; i++) cin>>r[i];
if(m == 1){
ll ans = 0;
for(int i = 0; i<m+n-1; i++){
ans += min(l[i], r[m+n-1-i-1]);
}
cout<<ans<<endl;
return;
}
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
//ifstream cin(""); ofstream cout("");///cia failai
//int T; cin>>T;
int T = 1;
for(int it = 1; it<=T; it++){
solve();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |