Submission #1547292

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
#define ll long long
#define FOR(a,b,c) for(int a=b;a<=c;a++)
#define in(a) a=read()
inline int read(){
    int X=0,w=1; char ch=0;
    while(ch<'0' || ch>'9') {if(ch=='-') w=-1;ch=getchar();}
    while(ch>='0' && ch<='9') X=(X<<3)+(X<<1)+ch-'0',ch=getchar();
    return X*w;
}
int a[10];
int main(){
	FOR(i,1,4)in(a[i]);
	ll c=min(min(min(a[1]*8,a[2]*4),a[3]*2),a[4]);
	int n;
	in(n);
	ll ans=c*(n/2);
	n%=2;
	if(n)ans+=min(min(min(a[1]*4,a[2]*2),a[3]),a[1]*2+a[2]);
	printf("%lld",ans);
}
	
	

Submission Info

Judge Result