Find the minimum number of elements required so that their sum equals or exceeds S

Question

I know this can be done by sorting the array and taking the larger numbers until the required condition is met. That would take at least nlog(n) sorting time.

Is there a

Answer 1

1. eliminate numbers < S, if you find some number ==S, then solved
2. pigeon-hole sort the numbers < S

Sum elements highest to lowest in the sorted order till you exceed S.