comefrom: <doocs>1403.Minimum Subsequence in Non-Increasing Order_1.py
code: def minSubsequence( nums: List[int]) -> List[int]:
      nums.sort(reverse=True)
      s = sum(nums)
      ans = []
      t = 0
      for v in nums:
          ans.append(v)
          t += v
          if t > s - t:
              break
      return ans
masked: def sample_funcname ( var_0 : List [ int ] ) -> List [ int ] :
      var_0.sort ( var_1 = True )
      var_2 = sum ( var_0 )
      var_3 = [ ]
      var_4 = 0
      for var_5 in var_0 :
          var_3.append ( var_5 )
          var_4 += var_5
          if var_4 > var_2 - var_4 :
              break
      return var_3
  