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_4 = True )
      var_7 = sum ( var_0 )
      var_8 = [ ]
      var_10 = 0
      for var_11 in var_0 :
          var_8.append ( var_11 )
          var_10 += var_11
          if var_10 > var_7 - var_10 :
              break
      return var_8
  