Submission #213983

---

Source Code Expand

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


long long N, H;
long long A, B, C, D, E;

void read() {
    cin >> N >> H;
    cin >> A >> B >> C >> D >> E;
}


void work() {
    long long minV = 1LL << 62;
    
    for (int i = 0; i <= N; ++i) {
        int L = 0;
        int R = N - i;
        while (L < R) {
            int mid = (L + R) / 2;
            if (H + B * i + D * mid - E * (N - i - mid) > 0)
                R = mid;
            else
                L = mid + 1;
        }
        minV = min(minV, A * i + C * L);
    }

    cout << minV << endl;
}


int main() {
    read();
    work();
    return 0;
}

Submission Info

Judge Result