Submission #1539245

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long lint; typedef pair<int, int> ii;
const int MOD = 1'000'000'007, MOD2 = 1'000'000'009;
const int INF = 0x3f3f3f3f; const lint BINF = 0x3f3f3f3f3f3f3f3fLL;

lint q, h, s, d, n;

int solve(){
	cin >> q >> h >> s >> d >> n;
	n = n * 4;
	lint one = q;
	lint two = min(one + one, h);
	lint four = min(two + two, s);
	lint eight = min(four + four, d);

	lint ans = 0;
	ans += n / 8 * eight; n %= 8;
	ans += n / 4 * four; n %= 4;
	ans += n / 2 * two; n %= 2;
	ans += n * one;
	cout << ans << endl;
    return 0;
}

int main(){
	ios::sync_with_stdio(0);
	// int t; cin >> t; while(t--)
	solve();
	// cout << (solve() ? "YES" : "NO") << endl;
	return 0;
}

Submission Info

Judge Result