10-sized subset with maximal sum less than K

Question

Question:

Given an array of floats (size N < 100), find the subset (size M = 10) whose sum is maximal but less than value K.

Exampl