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;
		using ll = long long;
        //#define int long long
        #define forn(i,n) for (int i=0; i<n; ++i)
    	const ll linf = LLONG_MAX;
		const int maxn = 2e5+5;
         
        int32_t main() {
          
          int n,m; cin>>n>>m;
          vector<ll> a(maxn), b(maxn);
          forn(i,n+m-1) cin>>a[i];
          forn(i,n+m-1) cin>>b[i];
          ll 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... |