Submission #6365523

---

Source Code Expand

#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>

using namespace std;
typedef pair<int, int> P;
typedef long long int ll;

const int INF = 1<<30;

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

Submission Info

Judge Result