Leetcode 1403. Minimum Subsequence in Non-Increasing Order

Find the smallest-length subsequence whose sum is strictly greater than the sum of the remaining elements; if multiple, pick the one with the larger total sum, and return it sorted in non-increasing order. This is typically solved by sorting and greedily taking the largest elements until their sum exceeds the rest.