# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1151465 | Muhammad_Aneeq | Bikeparking (EGOI24_bikeparking) | C++20 | 22 ms | 2632 KiB |
/*
بسم الله الرحمن الرحيم
Author:
(:Muhammad Aneeq:)
*/
#include <iostream>
#warning check the output
using namespace std;
inline void solve()
{
int n;
cin>>n;
int x[n],y[n];
for (auto& i:x)
cin>>i;
for (auto& i:y)
cin>>i;
int ans=0;
int j=n-2;
for (int i=n-1;i>=0;i--)
{
while (j>=i)
j--;
while (y[i]&&j>=0)
{
int z=min(x[j],y[i]);
y[i]-=z;
x[j]-=z;
ans+=z;
if (x[j]==0)
j--;
}
}
for (int i=0;i<n;i++)
{
int z=min(y[i],x[i]);
ans-=(y[i]-z);
}
cout<<ans<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int t=1;
for (int i=1;i<=t;i++)
{
solve();
}
}
Compilation message (stderr)
# | 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... |