Submission #213856

---

Source Code Expand

#include <iostream>
using namespace std;
typedef long long ll;
int main( void )
{
  ll N,H,A,B,C,D,E;
  cin >> N >> H;
  cin >> A >> B >> C >> D >> E;
  ll c = (1LL<<60);
  for( ll i=0; i<=N; i++ ){
    ll lo = 0;
    ll hi = N-i;
    while( lo <= hi ){
      ll mid = (lo+hi)/2;
      ll cc = i*A + mid*C;
      ll hh = H + i*B + mid*D - (N-i-mid)*E;
      if( hh > 0 ){
        c = min( c, cc );
        hi = mid-1;
      } else {
        lo = mid+1;
      }
    }
  }
  cout << c << endl;
}

Submission Info

Judge Result