#include <bits/stdc++.h>
using namespace std;
int main()
{
long long M, N;
cin >> M >> N;
vector<long long> GD(N + M - 1), DG(N + M - 1);
for (long long i = 0; i < N + M - 1; i++)
{
cin >> GD[i];
}
for (long long i = 0; i < N + M - 1; i++)
{
cin >> DG[i];
}
if (M == 1)
{
long long tot = 0;
for (long long i = 0; i < N; i++)
{
tot += min(DG[i], GD[N - i - 1]);
}
cout << tot;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
115 ms |
3552 KB |
Output is correct |
2 |
Correct |
113 ms |
7428 KB |
Output is correct |
3 |
Correct |
108 ms |
7392 KB |
Output is correct |
4 |
Correct |
116 ms |
7512 KB |
Output is correct |
5 |
Correct |
124 ms |
8020 KB |
Output is correct |
6 |
Correct |
97 ms |
6608 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
239 ms |
6684 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |