#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// int main()
// {
// ll m, n; cin >> m >> n;
// ll d = m+n-1;
// ll mn = 100000000000000;
// vector<ll> v1(d), v2(d);
// for (ll &i : v1) cin >> i;
// for (ll &i : v2) cin >> i;
// for (ll k1 = 0; k1 < (1<<d); k1++)
// {
// ll k2 = 0, t = 0;
// for (ll i = 0; i < m; i++)
// {
// for (ll j = 0; j < n; j++)
// {
// if (!(k1 & (1<<(i-j+n-1)))) k2 |= (1<<(i+j));
// }
// }
// for (int i = 0; i < d; i++)
// {
// if (k1 & (1<<i)) t += v1[i];
// if (k2 & (1<<i)) t += v2[i];
// }
// mn = min(mn, t);
// }
// cout << mn << '\n';
// return 0;
// }
int main()
{
ll m, n; cin >> m >> n;
ll d = m+n-1, x = 0;
vector<ll> v1(d), v2(d);
for (ll &i : v1) cin >> i;
for (ll &i : v2) cin >> i;
for (int i = 0; i < n; i++) x += min(v1[n-1-i], v2[i]);
cout << x << '\n';
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... |
# | 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... |