Submission #5313188

---

Source Code Expand

#include <iostream>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <math.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <climits>
#include <bitset>
#include <list>
#include <map>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;

int main(){
    ll q, h, s, d, n;
    cin >> q >> h >> s >> d >> n;
    ll h_min, s_min, d_min;
    h_min=min(h, 2*q);
    s_min=min({s, 2*h_min, 4*q});
    d_min=min(d, 2*s_min);
    ll ans=n*s_min;
    if(2*s_min>d_min) ans-=(2*s_min-d_min)*(n/2);
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result