1100: 采药 动态规划

解题思路:
先判断草药是否可以才，再用动态规划。
注意事项:

参考代码:

work_time, grass_number = map(int, input().split())

grass_time = []

grass_value = []

for i in range(grass_number):

    need_time, value = map(int, input().split())

    grass_time.append(need_time)

    grass_value.append(value)

row = [0] * (work_time + 1)

rol = [0] * (work_time + 1)

for i in range(grass_number):

    for j in range(work_time + 1):

        if grass_time[i] <= j:

            rol[j] = max(row[j], grass_value[i] + row[j - grass_time[i]])

    row = rol[ : ]

print (rol[work_time])