有N项食物营养价值为Vi,价格为Pi,i=1,2,...n.套餐中每项食物至多出现一次，客人通常需要一个算法求解不超过总价值的营养价值最大的套餐-Nutritional value of food items has N as Vi, the price for the Pi, i = 1,2, ... n. packages at most once in each of the food, the guests usually no more than an algorithm for the nutritional value of the total value of the largest package