#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> RD = vector<int>(n + m - 1);
vector<int> RU = vector<int>(n + m - 1);
for (int &x : RD)
cin >> x;
for (int &x : RU)
cin >> x;
reverse(RU.begin(), RU.end());
int sol = 0;
for (int i = 0; i < n + m - 1; i++)
sol += min(RD[i], RU[i]);
cout << sol;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
48 ms |
3404 KB |
Output is correct |
2 |
Correct |
51 ms |
3444 KB |
Output is correct |
3 |
Correct |
50 ms |
3440 KB |
Output is correct |
4 |
Correct |
64 ms |
3440 KB |
Output is correct |
5 |
Correct |
62 ms |
3444 KB |
Output is correct |
6 |
Correct |
49 ms |
3432 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
126 ms |
10676 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |