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;
typedef int64_t ll;
int main(){
    ll n;
    cin >> n;
    vector<ll> slots(n);
    vector<ll> users(n);
    for(ll i = 0; i < n; i++){
        cin >> slots[i];
    }
    for(ll i = 0; i < n; i++){
        cin >> users[i];
    }
    ll happy = 0;
    for(ll i = 0; i < n; i++){
        for(int j = i+1;  j < n; j++){
            ll x= min(slots[i], users[j]);
            slots[i]-=x;
            users[j]-=x;
            happy+=x;
        }
        ll x= min(slots[i], users[i]);
        slots[i]-=x;
        users[i]-=x;
    }
    happy -= accumulate(users.begin(), users.end(), ll(0));
    cout << happy;
}
| # | 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... |