0/1 Knapsack
1000ms 65536K
描述:
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.
给N个物品的重量和价值,把一些东西放到容量为C的背包里去使得在背包里的总价值最高。背包里的物品的总重量不超过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.
第一行:两个正整数N(N<=100),C (C<=1000)。
第二行:含有N元素个正整数的w[i] (w[i] <=1000),代表第i个物品的重量。
第三行:含有N元素个正整数的v[i] (v[i]<=1000),代表第i个物品的价值。
输出:
One line contains several integers, indicating the indexes of the selected items.
一行包括几个整数,代表被选择的物品的索引。
样例输入:
5 10 2 4 6 2 5 1 3 4 2 8
样例输出:
2 5