Submission #215010

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;

int main(void) {
	long n, h, a, b, c, d, e;
	cin >> n >> h;
	cin >> a >> b >> c >> d >> e;
	
	long ans = (long)(((unsigned long)-1) >> 1);

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

	cout << ans << endl;
}

Submission Info

Judge Result