Submission #1539592

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <fstream>

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>

#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <list>
#include <map>
// #include <unordered_map>
#include <set>
#include <utility>
#include <bitset>
#include <limits>
#include <climits>
using namespace std;


typedef long long ll;

ll solve(ll q,ll h,ll s,ll d,ll n) {
    ll one = min({ q*4, h*2, s });
    ll two = min(one*2, d);
    
    ll nh = n/2, nl = n%2;
    return two*nh + one*nl;
}

int main() {
    ll q,h,s,d;cin>>q>>h>>s>>d;
    ll n;cin>>n;
    cout << solve(q,h,s,d,n) << endl;
    return 0;
}

Submission Info

Judge Result