제출 #1048836

#제출 시각아이디문제언어결과실행 시간메모리
1048836EntityPlanttBikeparking (EGOI24_bikeparking)C++17
25 / 100
25 ms2804 KiB
#include <iostream>
using namespace std;

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n, u = 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 am = min(x[i], y[j]);
		u += am;
		x[i] -= am;
		y[j] -= am;
	}
	for (int i = 0; i < n; i++) u -= max(0, y[i] - x[i]);
	cout << u;
	return 0;
}
#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...