Submission #1540302

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<functional>
#include<math.h>
#include<vector>
#include<map>
#include<string>
#include<set>
#include<unordered_set>
#include<unordered_map>
#define P pair<double,double>
using namespace std;

P a[4];//1Lあたりの値段　量
signed main() {
	double b, c, d, e; cin >> b >> c >> d >> e;
	double S; cin >> S;
	a[0] = { b * 4,0.25 };
	a[1] = { c * 2,0.5 };
	a[2] = { d * 1,1 };
	a[3] = { e * 0.5,2 };
	sort(a, a + 4);
	long long ans = 0;
	for (int i = 0; i < 4; i++) {
		long long f = floor(S / a[i].second);
		ans += f*a[i].first*a[i].second;
		S -= f*a[i].second;
	}
	for (int i = 0; i < 4; i++) {
		long long f = floor(S / a[i].second);
		ans += f*a[i].first*a[i].second;
		S -= f*a[i].second;
	}
	for (int i = 0; i < 4; i++) {
		long long f = floor(S / a[i].second);
		ans += f*a[i].first*a[i].second;
		S -= f*a[i].second;
	}
	for (int i = 0; i < 4; i++) {
		long long f = floor(S / a[i].second);
		ans += f*a[i].first*a[i].second;
		S -= f*a[i].second;
	}
	for (int i = 0; i < 4; i++) {
		long long f = floor(S / a[i].second);
		ans += f*a[i].first*a[i].second;
		S -= f*a[i].second;
	}
	cout << ans << endl;
}

Submission Info

Judge Result