Submission #1097279

#TimeUsernameProblemLanguageResultExecution timeMemory
1097279Trisanu_DasBikeparking (EGOI24_bikeparking)C++17
25 / 100
38 ms5716 KiB
#include <bits/stdc++.h> using namespace std; int main() { cin.tie(0)->sync_with_stdio(0); int n, ans = 0; cin >> n; int x[n], y[n]; for(int i = 0; i < n; i++) cin >> x[i]; for(int i = 0; i < n; i++) cin >> y[i]; int i = 0, j = 1; while(true){ while(i < n && !x[i]) i++; if(i == n) break; if(i >= j) j = i + 1; while(j < n && !y[j]) j++; if(j == n) break; int curr = min(x[i], y[j]); ans += curr; x[i] -= curr; y[j] -= curr; } for(int i = 0; i < n; i++) ans -= max(0, y[i] - x[i]); cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...