t, n = map(int, input().split())
nums = []
for i in range(n):
nums.append(list(map(int, input().split())))
nums.sort()
dp = [0] * (t + 1)
for i in range(n):
cost = nums[i][0]
value = nums[i][1]
for j in range(t, cost - 1, -1):
dp[j] = max(dp[j], dp[j - cost] + value)
print(dp[-1])
洛谷 python P1048 [NOIP2005 普及组] 采药
于 2024-03-30 10:54:24 首次发布