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;
int main()
{
int M, N;
cin >> M >> N;
vector<int> GD(N + M - 1), DG(N + M - 1);
for (int i = 0; i < N + M - 1; i++)
{
cin >> GD[i];
}
for (int i = 0; i < N + M - 1; i++)
{
cin >> DG[i];
}
if (M == 1)
{
int tot = 0;
for (int i = 0; i < N; i++)
{
tot += min(DG[i], GD[N - i - 1]);
}
cout << tot;
}
}
# | 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... |