洛谷 python P1616 疯狂的采药

def main():
    t, m = map(int, input().split())

    if m == 1:
        ti, wi = map(int, input().split())
        print(t // ti * wi)
        return

    # dp[i] = max(dp[cost[i] * n] + value[i] * n)
    dp = [0] * (t + 1)
    for _ in range(m):
        cost, value = map(int, input().split())
        for i in range(cost, t + 1):
            dp[i] = max(value + dp[i - cost], dp[i])

    print(dp[-1])

main()