title: maximum sum of a subset of size K with sum less than M
body: <p>Given:
  array of integers
  value K,M</p>
  
  <p>Question:
  Find the maximum sum which we can obtain from all K element subsets of given array such that sum is less than value M?</p>
  
  <p>is there a non dynamic programming solution available to this problem?
  or if it is only dp[i][j][k] can only solve this type of problem!
  can you please explain the algorithm.</p>