Submission #48115119

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
using ModInt [[maybe_unused]] = atcoder::modint998244353;
using Num [[maybe_unused]] = long long int;
using Vec [[maybe_unused]] = std::vector<Num>;
using Set [[maybe_unused]] = std::set<Num>;
using Mset [[maybe_unused]] = std::multiset<Num>;
using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

template<typename T>
using Q [[maybe_unused]] = std::queue<T>;

template<typename T>
using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    Num n, s, m, l;
    is >> n >> s >> m >> l;

    Num ex = 1000000000000000000LL;
    for(Num is{0}; is<=100; ++is) {
        for(Num im{0}; im<=100; ++im) {
            for(Num il{0}; il<=100; ++il) {
                Num x = is * 6 + im * 8 + il * 12;
                if (x >= n) {
                    ex = std::min(ex, s * is + m * im + l * il);
                }
            }
        }
    }

    os << ex << "\n";
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result