Submission #1540593

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define SIZE(array) (sizeof(array) / sizeof(array[0]))

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

long mod = 1000000007L;

signed main() {
	ll q, h, s, d, n;
	cin >> q >> h >> s >> d >> n;
	ll rate = min(min(q * 4, h * 2), s);
	ll pay;
	if (rate * 2LL <= d) {
		pay = n * rate;
	} else {
		pay = (n / 2LL) * d + ((n % 2LL) * rate);
	}
	cout << pay << endl;
}

Submission Info

Judge Result