Submission #655757

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>

using namespace std;

const long long INF = 1e18;

int main() {
	long long n, h, a, b, c, d, e;
	cin >> n >> h >> a >> b >> c >> d >> e;

	long long ans = INF;
	for (int x = 0; x <= n; x++) {
		int y = ceil(1.0 * (e * (n - x) - h - b * x) / (d + e));
		y = max(y, 0);
		y = min(y, (int)n - x);
		long long cost = a * x + c * y;
		ans = min(ans, cost);
	}

	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result