Submission #1540618

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <algorithm>
#include <climits>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <ctime>
#include <cstdlib>
#include <iterator>
using namespace std;
struct A {
	long long L, v;
	double R; //单价
	bool operator < (const A tmp) const {
		return R == tmp.R ? L < tmp.L : R < tmp.R;
	}
}a[5];
//#define TEST
int main()
{
#ifdef TEST
	freopen("data.in", "r", stdin);
	freopen("data.out", "w", stdout);
#endif
	//ios::sync_with_stdio(false);
	long long n;
	while (cin >> a[1].v >> a[2].v >> a[3].v >> a[4].v >> n) {
		n *= 100;
		a[1].L = 25, a[1].R = a[1].v / (double) a[1].L; // 日元/升
		for (int i = 2; i <= 4; ++i) {
			a[i].L = a[i - 1].L * 2;
			a[i].R = a[i].v / (double)a[i].L;
		}
		sort(a + 1, a + 5);
		long long sum = 0;
		for (int i = 1; i <= 4; ++i) {
			sum += a[i].v * (n / a[i].L);
			n = n % a[i].L;
			if (n == 0) break;
		}
		cout << sum  << endl;
	}

	return 0;
}

Submission Info

Judge Result