原题目:https://leetcode-cn.com/problems/minimum-subsequence-in-non-increasing-order/
思路:
简单的贪心算法,从大到小排序后,取前几个即可
代码:
class Solution {
public:
vector<int> minSubsequence(vector<int>& nums) {
if(nums.size()==0) return {};
sort(nums.rbegin(),nums.rend());
int sum = 0;
for(int i:nums) sum += i;
int temp=0;
vector<int> ans;
for(int i:nums){
ans.push_back(i);
temp += i;sum-=i;
if(temp > sum) return ans;
}
return ans;
}
};