# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1151481 | Muhammad_Aneeq | Bikeparking (EGOI24_bikeparking) | C++20 | 81 ms | 16708 KiB |
/*
بسم الله الرحمن الرحيم
Author:
(:Muhammad Aneeq:)
*/
#include <iostream>
#include <set>
#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;
set<int>s;
for (int i=0;i<n;i++)
{
while (s.size()&&y[i])
{
int f=*rbegin(s);
int z=min(x[f],y[i]);
x[f]-=z;
y[i]-=z;
ans+=z;
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... |