Minimum Subsequence in Non-Increasing Order LeetCode solution in C++

1
class Solution {
2
 public:
3
  vector<int> minSubsequence(vector<int> &nums) {
4
    sort(nums.begin(), nums.end(), greater<int>());
5
    vector<int> res;
6
    int sum = 0;
7
    for (int i : nums) sum += i;
8

9
    int x = 0;
10
    for (int i = 0; i < nums.size(); i++) {
11
      x += nums[i];
12
      sum -= nums[i];
13
      res.push_back(nums[i]);
14
      if (x > sum) break;
15
    }
16
    return res;
17
  }
18
};