LC1403 非递增顺序的最小子序列

贪心算法

class Solution {
public:
    vector<int> minSubsequence(vector<int>& nums) {
        sort(nums.begin(), nums.end(), greater<int>()); // 内置从大到小排序，less<int>()从小到大排序
        int sum = 0;
        for (auto mem : nums) {
            sum += mem;
        }
        int temp = 0;
        for (int i = 0; i < nums.size(); i++) {
            temp += nums[i];
            if (temp > sum - temp) return vector<int>(nums.begin(), nums.begin() + i + 1);
        }
        return nums;
    }
};