Submission #1594174

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

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

  ll ans = 1e12;
  for (ll i = 0; i <= n; i++) {
    ll k = max(0LL, ((n - i) * e - i * d - h) / (b - d) + 1);
    if (k > i || h + i * d + k * (b - d) - (n - i) * e <= 0) continue;
    ans = min(ans, k * a + (i - k) * c);
  }

  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result