LintCode-761. 最小子集

public class Solution {
    /**
     * @param arr:  an array of non-negative integers
     * @return: minimum number of elements
     */
    public int minElements(int[] arr) {
        // write your code here
        List<Integer> nums = new ArrayList<>();
        int sum = 0, temp = 0;
        for(int num : arr){
            sum += num;
            nums.add(num);
        }
        Collections.sort(nums);
        int size = nums.size();
        for (int i = 1; i < size; i++){
            temp += nums.get(size - i);
            if(temp > sum / 2) return i;
        }
        return 0;
    }
}