| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1338722 | athena | Bikeparking (EGOI24_bikeparking) | C++20 | 29 ms | 5128 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin>>n;
int arr[n];
int brr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
int s=0;
for(int i=0;i<n;i++){
cin>>brr[i];
s+=brr[i];
}
int ans=0;
//assign diagonally
//n-1 happy 1 unhappy
cout<<max(0LL,s-brr[0]-brr[0])<<endl;
}| # | 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... | ||||
