Submission #1652041

---

Source Code Expand

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

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) for(int i=0;i<=(n);++i)
#define ALL(v) (v).begin(),(v).end()

typedef long long ll;
typedef pair<ll, int> P;

ll q,h,s,d,n;
priority_queue<P,vector<P>,greater<P> > pq;

int main(){
	cin.tie(0);
  ios::sync_with_stdio(false);

	cin>>q>>h>>s>>d>>n;
	if(n==1) {
		ll mi=min(q*4,min(h*2,s));
		cout<<mi<<endl;
		return 0;
	}
	pq.push(P(q*8,1)); pq.push(P(h*4,1)); pq.push(P(s*2,1)); pq.push(P(d,2));
	ll two=n/2;
	ll one=n%2;
	if(one==0) {
		P p=pq.top();
		cout<<n/2*p.first<<endl;
		return 0;
	}
	else {
		ll ans=0;
		P p=pq.top();pq.pop();
		if(p.second==2) {
			ans+=n/2*p.first;
			P q=pq.top();
			ans+=q.first/2;
		}
		else {
			ans+=n*p.first/2;
		}
		cout<<ans<<endl;
		return 0;
	}

	return 0;
}

Submission Info

Judge Result