Submission #1539920

---

Source Code Expand

#include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
const double EPS = 1.0e-8;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
const int  maxn = 1e5 + 100;
const int  maxm = 300;
int cost[5];
double now[5];
int main()
{
        now[1] = 0.250, now[2] = 0.50, now[3] = 1.0, now[4] = 2.0;
        for (int i = 1; i <= 4; i++)
        {
                cin >> cost[i];
        }
        for (int i = 2; i <= 4; i++)
                for (int j = 1; j < i; j++)
                {
                        int cur = (int)(now[i] / now[j]) * cost[j];
                        cost[i] = min(cost[i], cur);
                }
        double sum;
        ll anser = 0;
        cin >> sum;
        while (sum > 0)
        {
                for (int i = 4; i >= 1; i--)
                {
                        if (now[i] <= sum)
                        {
                                sum -= now[i];
                                anser += cost[i];
                                break;
                        }
                }
        }
        cout<<anser<<endl;
}

Submission Info

Judge Result