Submission #5801510

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1e9 + 7;
const ll INF = LLONG_MAX;

int main()
{
    vector<ll> a(3);
    ll d, n;
    cin >> a[0] >> a[1] >> a[2] >> d >> n;
    a[0] *= 4;
    a[1] *= 2;
    sort(a.begin(), a.end());
    ll ans = 0;
    if (a[0] * 2 <= d)
    {
        ans = a[0] * n;
    }
    else
    {
        ans = d * (n / 2) + a[0] * (n % 2);
    }
    cout << ans << endl;
}

Submission Info

Judge Result