【 a daily topic 】 1403. The increasing order of the sequence, boy

1403. Minimum subsequence in non-increasing order

Greedy:
Sort nums first (in ascending order), then start selecting from back to front, when "sum of selected elements is strictly greater than the sum of unselected elements" is satisfied for the first time,It must meet the minimum number of selected elements. If there are other legal schemes with the same number, it also satisfies that the selected scheme is the element sum maximum scheme, and at the same time meets the requirement that the answer output is in non-ascending order.

class Solution {public List<Integer> minSubsequence(int[] nums