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;
    #define int long long
    #define forn(i,n) for (int i=0; i<n; ++i)
	const int linf = LLONG_MAX;
     
    int32_t main() {
      
      int n,m; cin>>n>>m;
      vector<int> a(n+m-1,linf), b(n+m-1,linf);
      forn(i,n+m-1) cin>>a[i];
      forn(i,n+m-1) cin>>b[i];
      int ans=0;
      forn(i,n+m-1) ans+=min(a[i],b[i]);
      cout<<ans<<'\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... |