Submission #1539235

---

Source Code Expand

//

/*
    __          ____  ________       
   / /   ____  / __ \/_  __/ /_  ___ 
  / /   / __ \/ / / / / / / __ \/ _ \
 / /___/ /_/ / /_/ / / / / / / /  __/
/_____/\____/_____/ /_/ /_/ /_/\___/ 
                                     
                                     */

#include <iostream>
#include <string>
#include <cmath>
#include <vector>
#include <algorithm>
#include <iterator>
#include <cstdlib>
#include <cstdio>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <list>

using namespace std;

typedef pair <int, int> pii;
typedef pair <long long, long long> pll;
typedef vector <int> vi;
typedef long long ll;

#define endl "\n"
#define mp make_pair
#define pb push_back

const int mod = 1000000007;

ll q, h, s, d, n;
ll result = 2e9;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin >> q >> h >> s >> d >> n;

	result = 4 * q * n;
	result = min(result, 2 * h * n);
	result = min(result, s * n);

	if (n & 1)
		result = min(result, (n / 2) * d + min(q * 4, min(h * 2, s)));
	else
		result = min(result, (n / 2) * d);

	cout << result << endl;

	return 0;
}

Submission Info

Judge Result