Submission #1540669

---

Source Code Expand

#include<bits/stdc++.h>
#define For(i , j , k) for (int i = (j) , _##end_ = (k) ; i <= _##end_ ; ++ i)
#define Fordown(i , j , k) for (int i = (j) , _##end_ = (k) ; i >= _##end_ ; -- i)
#define Set(a , b) memset(a , b , sizeof(a))
#define pb push_back
#define Mod 1000000007
typedef unsigned long long LL;
using namespace std;

struct Item
{
	LL a , b;
}a[6];

LL n;

int _ , __;
char c_;
int read()
{
	for (_ = 0,__ = 1,c_ = getchar();!isdigit(c_);c_=getchar())if (c_ == '-')__ = -1;
	for (;isdigit(c_);c_=getchar())_ = (_ << 1) + (_ << 3) + (c_ ^ 48);
	return _ * __;
}

int main()
{
#ifdef hany01
	freopen("test.in" , "r" , stdin);
	freopen("test.out" , "w" , stdout);
#endif
	cin >> a[1].a >> a[2].a >> a[3].a >> a[4].a >> n;
	a[1].b = 1;
	a[2].b = 2;
	a[3].b = 4;
	a[4].b = 8;
	n *= 4;
	LL Ans = 0;
	while (n)
	{
		LL Min = 900000000000 , k;
		For(i , 1 , 4)
			if (Min > a[i].a * a[5 - i].b)
			{
				Min = a[i].a * a[5 - i].b;
				k = i;
			}
		Ans += (n / a[k].b) * a[k].a;
		n %= a[k].b;
		a[k].a = 9000000000000;
	}
	cout << Ans << endl;
	return 0;
}

Submission Info

Judge Result