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

代码实现（自解）

class Solution {
public:
    vector<int> minSubsequence(vector<int>& nums) {
        sort(nums.begin(), nums.end(), greater<int>());
        int sum = accumulate(nums.begin(), nums.end(), 0);
        int ans = 0;
        int pnum = 0;
        while (ans * 2 <= sum) {
            ans += nums[pnum];
            pnum++;
        }
        vector<int> sub;
        for (int i = 0; i < pnum; i++) {
            sub.push_back(nums[i]);
        }
        return sub;
    }
};
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18