# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1151823 | KaleemRazaSyed | Bikeparking (EGOI24_bikeparking) | C++20 | 83 ms | 3084 KiB |
#include<bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
int n;
vector<int> x, y;
int main()
{
cin >> n;
x.resize(n), y.resize(n);
for(int i = 0; i < n; i ++)
cin >> x[i];
for(int i = 0; i < n; i ++)
cin >> y[i];
int sm = 0;
for(int i = 0; i < n; i ++)
sm += y[i];
for(int i = 0; i < n; i ++)
{
x[i] = min(sm, x[i]);
sm -= x[i];
}
# | 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... |