This is a famous dynamic programming problem that comes up in the optimization section. 

It basically comes from the name of a scene where a set of items with a specific weight and a set value is given, with the goal being to maximize within Knapsack while within the weight limit. Since we do not have more than one item, each and every item can be selected only once