title: Minimum set of numbers that sum to least K
body: <p>Given a list of n objects, write a function that outputs the minimum set of numbers that sum to at least K. FOLLOW UP: can you beat O(n ln n)?</p>
  
  <p>The minimum set will be a set with 1 element. Don't we just have to traverse the array and find an element i.e. >= K. </p>
  
  <p>Otherwise for O(nlgn), I understand we have to first sort the array and then we can find pair or triplets which sum >=k. 
  What if we don't find such a combination and have to go for bigger sets won't this problem be same as N sum problem?</p>