1403-minimum-subsequence-in-non-increasing-order.js

/**
 * 1403. Minimum Subsequence in Non-Increasing Order
 * https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/
 * Difficulty: Easy
 *
 * 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.
 */

/**
 * @param {number[]} nums
 * @return {number[]}
 */
var minSubsequence = function(nums) {
  const sorted = nums.sort((a, b) => b - a);
  const totalSum = sorted.reduce((sum, num) => sum + num, 0);
  const result = [];
  let currentSum = 0;

  for (const num of sorted) {
    currentSum += num;
    result.push(num);
    if (currentSum > totalSum - currentSum) break;
  }

  return result;
};