The smallest subset with sum greater than sum of all other elements

Given an array of non-negative integers. Our task is to find minimum number of elements(Subset) such that their sum should be greater than the sum of rest of the elements of the array.


This is a companion discussion topic for the original entry at http://iq.opengenus.org/smallest-subset-with-sum-greater-than-all-other-elements/