Submission #2854969

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

typedef long int li;

const li MAX_N = 1000000000;

int main(int argc, char const *argv[]) {
  li q, h, s, d, n;
  cin >> q >> h >> s >> d >> n;
  li H, S;
  H = min(h,q*2);
  S = min(s,H*2);
  li ans;
  if (S*2 <= d) ans = S * n;
  else ans = d *(n/2) + S*(n%2);
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result