Submission #1540615

---

Source Code Expand

#include <iostream>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>

using namespace std;
typedef long long ll;
ll arr[5];
ll weight;
//ll dp[10000000];
ll mnn1, mnn2;

int main(int argc, const char * argv[]) {
    ios_base::sync_with_stdio(false);
    cin >> arr[0] >> arr[1] >> arr[2] >> arr[3];
    cin >> weight;
    ll t1 = arr[0] * 4;
    ll p1 = arr[1] * 2;
    ll t2 = arr[0] * 8;
    ll p2 = arr[1] * 4;
    mnn1 = min(min(t1, p1), arr[2]);
    ll W = weight;
    mnn2 = min(min(t2, p2), arr[3]);
    ll ret = 0;
    mnn2 = min(mnn2, arr[2] * 2);
    while(weight - 2 > 0){
        ret += mnn2;
        weight -= 2;
    }
    ret += (weight * mnn1);
    cout << ret << endl;
    ll ret2 = (W * mnn1);
    cout << min(ret2, ret) << endl;
    return 0;
    
}

Submission Info

Judge Result