Submission #7613015

---

Source Code Expand

from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools


import queue
from collections import deque



def main():
    num_day, now_mannpuku = map(int, input(). split())
    a, b, c, d, e = map(int, input().split())


    ans = 10 ** 12
    for i in range(num_day):
        x = max(((e * num_day - e * i - now_mannpuku - b * i) // (d + e)) + 1, 0)
        cost = i * a + x * c
        # aaa = b * i + d * x - (num_day - i - x) * e + now_mannpuku
        # print(cost, i, x, aaa)
        ans = min(ans, cost)

    print(ans)






if __name__ == '__main__':
    main()

Submission Info

Judge Result