Submission #1157448

---

Source Code Expand

# -*- coding: utf-8 -*-
import math,string,itertools,fractions,heapq,collections,re,array,bisect

def s():
    return raw_input().strip()
def n():
    return int(raw_input())
def d():
    return float(raw_input())

def ls():
    return raw_input().strip().split()
def ln():
    return map(int, raw_input().strip().split())
def ld():
    return map(float, raw_input().strip().split())

def fs():
    return [raw_input().strip() for i in xrange(input())]
def fn():
    return [int(raw_input().strip()) for i in xrange(input())]
def fd():
    return [float(raw_input().strip()) for i in xrange(input())]

EPS = 1e-9

#http://www.deqnotes.net/acmicpc/2d_geometry/lines
def dot(a, b):
    return a.real * b.real + a.imag * b.imag

def cross(a, b):
    return a.real * b.imag - a.imag * b.real

def distance(a, b, c):
    if dot(b-a, c-a) <= EPS:
        return abs(c-a)
    if dot(a-b, c-b) <= EPS:
        return abs(c-b)
    return abs(cross(b-a, c-a)/(b-a))

N = n()
A = ln()

A.sort()

cum = [A[0]]
for a in A[1:]:
    cum.append(cum[-1] + a)

#print cum

#for i, a in enumerate(A):
#    print i, a

x2 = len(A) - 1
result = 1
for i in xrange(len(A) - 2, -1, -1):
    #while A[x2] > 2 * A[i] and x2 > 0:
    #    x2 -= 1
    #cum[x2] - A[i]
    if cum[i] * 2 < A[i + 1]:
       break
    
    result += 1

print result

Submission Info

Judge Result