C# algorithm - find least number of objects necessary

Question

Let\'s say I have the following code.

var numberToGetTo = 60; 
var list = new[] {10, 20, 30, 40, 50};

I want to be able to return 50 &

Answer 1

Knapsack Problem, this may give you a clue.

http://en.wikipedia.org/wiki/Knapsack_problem

I'd say that you could create a lambda expression containing the actual alogrithm, but you'll need to use C#. Using 'just linq' will not be enough.