Submission #214344
Source Code Expand
\#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <utility>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <list>
#include <functional>
#include <cstring>
#include <set>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
const int INF = 1 << 29;
typedef long long ll;
ll N, H, A, B, C, D, E;
int main()
{
cin >> N >> H;
cin >> A >> B >> C >> D >> E;
ll ans = INF;
for (ll a = 0; a <= N; a++) {
for (ll b = 0; b <= N; b++) {
ll c = N - a - b;
if (c < 0)break;
if (B*a + D*b - E*c + H >= 0) {
ans = min(ans, A*a + C*b);
}
}
}
cout << ans << endl;
return 0;
}