Submission #2865561

---

Source Code Expand

# Your code here!
n = gets.to_i

arr = gets.split.map(&:to_i).sort
sum=Array.new(n,0)
sum[0] = arr[0]
i=1
(n-1).times{
    
    sum[i] = sum[i-1]+arr[i]
    
    i+=1
}

key=0
j=0

(n-1).times{
    
    if sum[j]*2<arr[j+1]
        key = j+1  
    end
    
   j+=1 
    
}

puts  n-key

Submission Info

Judge Result