Link: https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/
Given the array nums, obtain a subsequence of the array whose sum of elements is strictly greater than the sum of the non included elements in such subsequence.
If there are multiple solutions, return the subsequence with minimum size and if there still exist multiple solutions, return the subsequence with the maximum total sum of all its elements. A subsequence of an array can be obtained by erasing some (possibly zero) elements from the array.
Note that the solution with the given constraints is guaranteed to be unique. Also return the answer sorted in non-increasing order.
Example 1:
Input: nums = [4,3,10,9,8]
Output: [10,9]
Explanation: The subsequences [10,9] and [10,8] are minimal such that the sum of their elements is strictly greater than the sum of elements not included, however, the subsequence [10,9] has the maximum total sum of its elements.Example 2:
Input: nums = [4,4,7,6,7]
Output: [7,7,6]
Explanation: The subsequence [7,7] has the sum of its elements equal to 14 which is not strictly greater than the sum of elements not included (14 = 4 + 4 + 6). Therefore, the subsequence [7,6,7] is the minimal satisfying the conditions. Note the subsequence has to returned in non-decreasing order.Example 3:
Input: nums = [6]
Output: [6]Constraints:
- 1 <= nums.length <= 500
- 1 <= nums[i] <= 100
題目翻譯:
就是在陣列中取最少的元素，而這些被選重的元素總和必須大於其他元素合。
程式思路:
很 easy 的題目。先把陣列排過一遍，然後計算總合，在慢慢扣掉元素值，即是答案。
class Solution {
public:
vector<int> minSubsequence(vector<int>& nums) {
sort(nums.begin(),nums.end(),std::greater<int>());
auto sum = std::accumulate(nums.begin(), nums.end(), 0);
int dsum = 0,i;
for(i = 0; i < nums.size(); i++)
{
if(sum < dsum)
break;
sum -= nums[i];
dsum += nums[i];
}
return vector<int> (nums.begin(),nums.begin() + i);
}
};
