LeetCode 1403 Minimum subsequence in non-increasing order [greedy] HERODING's LeetCode road

解题思路：
First get the sum of the array,然后对数组进行排序,Because as far as possible to find the sequence with the smallest length and greater than half of the original array,So start from big to small,代码如下：

class Solution {
    
public:
    vector<int> minSubsequence(vector<int>& nums) {
    
        int n = nums.size();
        int total = accumulate(nums.begin(), nums.end(), 0);
        sort(nums.begin(), nums.end());
        vector<int> ans;
        int cur = 0;
        for(int i = n - 1; i >= 0; i --) {
    
            if(cur <= total / 2) {
    
                ans.emplace_back(nums[i]);
                cur += nums[i];
            } else {
    
                break;
            }
        }
        return ans;
    }
};