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和c
第二行:n个正整数,分别表示每个物品的重量
第三行:n个正整数,分别表示每个物品的价值
输出:
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