Submission #1540580

---

Source Code Expand

#include <iostream>
#include <algorithm>

using namespace std;

int solve() {
	int costs[4] = { 0 };
	int count[4] = { 1, 2, 4, 8 };
	cin >> costs[0];
	for (int i = 1; i < 4; ++i) {
		cin >> costs[i];
		costs[i] = min(costs[i], costs[i - 1] * 2);
	}
	long long n;
	cin >> n;
	n *= 4;
	long long ans = 0;
	for (int i = 3; i >= 0; i--) {
		ans += (long long)(n / count[i])*costs[i];
		n %= count[i];
	}
	cout << ans << endl;
	return 0;
}

int main() {
	return solve();
}

Submission Info

Judge Result