leetcode-master/problems/1403.非递增顺序的最小子序列.md

你说这是简单题吧，也是这就使用了贪心算法

class Solution {
private:
    static bool cmp(int a, int b) {
        return a > b;
    }
public:
    vector<int> minSubsequence(vector<int>& nums) {
        sort(nums.begin(), nums.end(), cmp);
        int sum = 0;
        for (int i = 0; i < nums.size(); i++) sum += nums[i];
        vector<int> result;
        int resultSum = 0;
        for (int i = 0; i < nums.size(); i++) {
            resultSum += nums[i];
            result.push_back(nums[i]);
            if (resultSum > (sum - resultSum)) break;
        }
        return result;
    }
};