1403. 非递增顺序的最小子序列

将数组按倒序排序后，依次将数组中最大的数加入新数组，比较两者之和

class Solution {
public:
    vector<int> minSubsequence(vector<int>& nums) {
        sort(nums.begin(), nums.end(), [](auto& a, auto b){
            return a > b;
        });
        int sum = 0;
        for (int i:nums) {
            sum += i;
        }
        vector<int> ans;
        int subSum = 0, i = 0;;
        while(subSum <= sum) {
            subSum += nums[i];
            sum -= nums[i];
            ans.push_back(nums[i]);
            ++i;
        }
        return ans;
    }
};