'''
class Solution:
def minSubsequence(self, nums: List[int]) -> List[int]:
s=sum(nums)
nums.sort()
idx=0
c=0
if len(nums)==1:
return nums
elif len(nums)==2:
if nums[0]==nums[1]:
return nums
else:
return nums[1:2]
for j in range(len(nums)-1,0,-1):
c=c+nums[j]
nums[idx]=nums[j]
idx=idx+1
if c>(s//2):
break
return nums[:idx]

'''