Submission #1539237

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <bitset>
#include <vector>
#include <queue>

using namespace std;

typedef long long ll;
#define FOR(i,a,b)   for(ll i = (a); i < (b); i++ )
#define REP(i, n)    FOR(i,0,n)
typedef pair< ll, ll >   cp2;
typedef pair< ll, cp2 >   cp3;
#define fi first
#define se second
#define sec  se.fi
#define thr  se.se
const ll mod = 1000000007;
//              123456789

 
///////////////////////////////////////////////
//
//
///////////////////////////////////////////////

////////////////////////////////////////////////
////////////////////////////////////////////////


ll Q, H, S, D;
ll N;
ll ans;

int main(){
	
	cin>>Q>>H>>S>>D;
	cin>>N;
	
	H = min( H, 2*Q );
	S = min( S, 2*H );
	D = min( D, 2*S );
	
	ans += D*(N/2);
	N %= 2;
	if( N ) ans += S;
	
	cout<<ans<<endl;	
	
	return 0;
	
}

Submission Info

Judge Result