[LeetCode][Go] LeetCode 1403. Minimum Subsequence in Non-Increasing Order

func minSubsequence(nums []int) []int {
    sum, sum2 := 0, 0
    for _, n := range nums {
        sum += n
    }
    
    sort.Slice(nums, func(a, b int) bool {return nums[b] < nums[a]})
    
    i := 0
    for i < len(nums) && sum2 <= sum - sum2 {
        sum2 += nums[i]
        i += 1
    } 
    
    return nums[:i]
}