Submission #1539230

---

Source Code Expand

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

#define fo(i,s,t) for(int i = s; i <= t; ++ i)
#define fd(i,s,t) for(int i = s; i >= t; -- i)
#define bf(i,s) for(int i = head[s]; i; i = e[i].next)
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define pb push_back
#define VI vector<int>
#define sf scanf
#define pf printf
#define fp freopen
#define SZ(x) ((int)(x).size())
#define IF_DEBUG 0
typedef long long ll;
typedef double db;
const int inf = 1<<30;
const ll INF = 1ll<<60;
const db Inf = 1e20;
const db eps = 1e-9;

void gmax(int &a,int b){a = (a > b ? a : b);}
void gmin(int &a,int b){a = (a < b ? a : b);}
ll Q, H, S, D, N, mn;

int main()
{
	cin >> Q >> H >> S >> D >> N;
	mn = D;
	if(Q*8 < mn) mn = Q*8;
	if(H*4 < mn) mn = H*4;
	if(S*2 < mn) mn = S*2;
	if(N%2==0) cout << N/2*mn << endl;
	else 
	{
		ll ans = N/2*mn;
		mn = S;
		if(Q*4 < mn) mn = Q*4;
		if(H*2 < mn) mn = H*2;
		cout << ans + mn << endl;
	}  
	return 0;
}

Submission Info

Judge Result