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 ll long long
#define ld long double
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
void solve()
{
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n);
ll sum = 0;
rep(i,n) cin >> a[i];
rep(i,n) cin >> b[i];
rep2(i,1,n-1) sum += b[i];
int p1 = 0;
int p2 = 0;
ll ans = 0;
while(p2 < n)
{
int od = min(a[p1],b[p2]);
if(p1 < p2)
{
ans += od;
a[p1] -= od;
b[p2] -= od;
if(a[p1] == 0) p1++;
else p2++;
}
else
{
p2++;
}
}
p1 = 0;
p2 = 0;
while(p2 < n)
{
int od = min(a[p1],b[p2]);
if(p1 == p2)
{
a[p1] -= od;
b[p2] -= od;
if(a[p1] == 0) p1++;
else p2++;
}
else
{
p2++;
}
}
rep(i,n) ans -= b[i];
cout << ans << "\n";
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random();
int t = 1;
//cin >> t;
while(t--) solve();
}
# | 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... |