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];
ll ans = 0;
set<int> s;
rep(i,n) if(a[i] > 0) s.insert(i);
int i = 0;
while(i < n)
{
auto it = s.lower_bound(i);
if(it == s.begin())
{
i++;
}
else
{
it--;
int od = min(a[*it],b[i]);
a[*it] -= od;
b[i] -= od;
ans += od;
if(a[*it] == 0)
{
s.erase(it);
}
if(b[i] == 0)
{
i++;
}
}
}
i = 0;
while(i < n)
{
auto it = s.find(i);
if(it == s.end())
{
ans -= b[i];
i++;
}
else
{
ans -= max(0LL,b[i] - a[i]);
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();
}
Compilation message (stderr)
Main.cpp: In function 'void solve()':
Main.cpp:29:8: warning: unused variable 'sum' [-Wunused-variable]
29 | ll sum = 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... |