Can Anyone Guide Me Where I Can Get Solution For This Problem

See more:

C#

Question:
A tourist wants to make a good trip at the weekend with his friends. They will go to the mountains to see the wonders of nature, so he needs to pack well for the trip. He has a good knapsack for carrying things, but knows that he can carry a maximum of only 4kg in it and it will have to last the whole day. He creates a list of what he wants to bring for the trip but the total weight of all items is too much. He then decides to add columns to his initial list detailing their weights and a numerical value representing how important the item is for the trip.

The tourist can choose to take any combination of items from the list, but only one of each item is available. He may not cut or diminish the items, so he can only take whole units of any item.
Which items does the tourist choose in order to get the total maximum value and not exceed the weight that the knapsack can carry?

Here is the list:

item 	weight (grams) 	value 
map 	         90 	150 
compass 	 130 	35 
water 	        1530 	300 
Gold bar 	3000 	130 
sandwich 	500 	160 
glucose 	150 	60 
tin 	        680 	45 
banana   	270 	60 
apple 	        390 	40 
cheese   	230 	30 
beer 	        620 	10 
suntan cream 	110 	70 
camera          320 	30 
T-shirt 	240 	15 
trousers 	480 	10