Submission #1540624

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <cstring>
#include <string>
#include <cmath>
#include <functional>
#include <queue>
#include <map>
using namespace std;

typedef long long ll;
const int M = 1e9 + 7;
const int N = 2e5 + 10;
const int MAX = 1e9 + 1;
//int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};

int n;

int main() {
    int i, j;
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    int n;
    cin >> n;
    a *= 8;
    b *= 4;
    c *= 2;
    if (n % 2 == 0) {
        cout << (ll)n / 2LL * (ll)min(min(min(a, b), c), d) << endl;
    }
    ll ans = (ll)(n / 2) * (ll)min(min(min(a, b), c), d);
    ans += (ll)min(min(a / 2, b / 2), c / 2);
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result