Submission #1539626

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1000000007;

int main(){
    ll l[4] = {8, 4, 2, 1};
    ll v[4];
    vector<P> vs;
    for(int i=0;i<4;i++){
        cin >> v[i];
        vs.emplace_back(v[i] * l[i], i);
    }
    sort(vs.begin(), vs.end());

    int N;
    cin >> N;
    if(N % 2 == 1){
        if(vs[0].second == 3){
            cout << (N / 2) * v[3] + vs[1].first / 2 << endl;
        }else{
            cout << (vs[0].first / 2) * N << endl;
        }
    }else{
        cout << (N / 2) * vs[0].first << endl;
    }

    return 0;
}

Submission Info

Judge Result