Submission #6347104

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
  ll q,h,s,d,n;
  cin>>q>>h>>s>>d>>n;
  vector<tuple<double,ll,double>> vec;
  vec.push_back(make_tuple(4*q,4*q,1));
  vec.push_back(make_tuple(2*h,2*h,1));
  vec.push_back(make_tuple(s,s,1));
  vec.push_back(make_tuple(d/2,d,2));
  sort(vec.begin(),vec.end());
  ll f=get<1>(vec[0]);
  double c=get<2>(vec[0]);
  if(c!=2.0){
    cout<<n*f;
    return 0;
  }
  n-=n%2;
  cout<<n/2*f+n%2*get<1>(vec[1]);
}

Submission Info

Judge Result