ltOpenJudge - 04:0/1 Knapsack
描述
Given the weights and values of N items, put a subset of items into a knapsack of capacity C to get the maximum total value in the knapsack. The total weight of items in the knapsack does not exceed C.
输入
First line: two positive integers N (N <= 100) and C (C <= 1000).
Second line: N positive integers w[i] (w[i] <= 1000), indicating the weight of the i-th item.
Third line: N positive integers v[i] (v[i] <= 1000), indicating the value of the i-th item.
输出
One line containsseveral integers, indicating the indexes of the selected items
翻译:
给出N个物品的重量和价值。将它们中的一部分放入一个容量为C的背包中,要求价值最大,并且物品的总重不能超过背包的容量C。
输入:
第一行;两个正整数N和C,都小于100.
第二行:N个正整数,w[i]表示第i个物体的重量。
第三行:N个物体,v[i]表示第i个物体的价值。