Submission #215086

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <cassert>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <sstream>
#include <istream>
#include <cmath>
#include <cstdio>
#include <complex>

using namespace std;

// figure
typedef long long ll;

// repeat
#define for_(i, a, b) for (int i=a; i<b; i++)
#define for_d(i, b, a) for (int i=b-1; i>=a; i--)
#define FOR(it, c) for(__typeof((c).begin())it=(c).begin(); it!=(c).end(); it++)

// for STL
#define pb push_back
#define sz size()
#define all(x) x.begin(), x.end()
typedef vector<int> veci;
typedef vector<string> vecs;
typedef map<int, int> mapii;
typedef map<char, int> mapci;
typedef pair<int, int> P;

// memory
#define minit(a, i) memset(a, i, sizeof(a));

// inf
const int iINF = 2147483647;
const ll lINF = 9223372036854775807;

// eps
double EPS = 1e-9;

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

int main() {
	cin >> N >> H;
	cin >> A >> B >> C >> D >> E;
	
	ll ans = lINF;
	
	for (ll i = 0; i <= N; i++) {
		ll j = ( (N - i) * E - H - i * B ) / (D + E) + 1;
		if (i + j > N) continue;
		ll cost = i * A + j * C;
		ans = min(ans, cost);
	}
	
	cout << ans << endl;
	
	return 0;
}

Submission Info

Judge Result