Submission #1543139

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <string>
#include <cstring>
#include <fstream>
#include <random>
#include <tuple>
using namespace std;

bool cmp(const pair<long long, long long> &p1, pair<long long,long long> &p2) {
    return p1.second * p2.first < p1.first * p2.second;
}
int main() {
    vector<pair<long long,long long>> v;
    long long q, h, s, d, n;
    cin>>q>>h>>s>>d>>n;
    v.emplace_back(25, q);
    v.emplace_back(50, h);
    v.emplace_back(100, s);
    v.emplace_back(200, d);
    sort(v.begin(), v.end(), cmp);
    long long ans = n * 100 / v[0].first * v[0].second;
    if (v[0].first == 200 && n % 2 != 0) {
        ans += v[1].second * 100 / v[1].first;
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result