we have n items with w weights and values, and we have a knpasack with capacity w. we have only one copy of each item. whats the most valuable way to fill the knapsack