knapsack

 n = 7

w = 15

cost = [10, 20, 30, 40, 50,80,60]

weight = [1, 2, 3, 8, 7,1,3]

c = [0]*(w+1)

for i in range(n):

    for j in range(w,weight[i]-1,-1):

        c[j]=max(c[j],c[j-weight[i]]+cost[i])

print(max(c))

#執行結果
#230