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>
#define int long long
using namespace std;
const int NMAX = 2e5;
int a[NMAX * 2 + 5];
int b[NMAX * 2 + 5];
signed main()
{
    int n, m;
    cin >> m >> n;
    for (int i=1; i<n+m; i++)
        cin >> a[i];
    for (int i=1; i<n+m; i++)
        cin >> b[i];
    int ans = 0;
    if (n == 1 || m == 1)
    {
        for (int i=1; i<n+m; i++)
        {
            ans += min(a[i], b[i]);
        }
        cout << ans;
    }
    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... |