ZhenlongDai/ACPR huggingface dataset:
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
nums = int(input())
input_list = [int(x) for x in input().split()]
input_list.sort(reverse=True)
max_num = input_list.pop(0)
print(input_list)
if max_num < sum(input_list):
    print("Yes")
else:
    print("No")



Failing test case input:
4
6 -9 -1 0

Expected output:
No


Actual output:
[0, -1, -9]
No


Fixed submission (verdict: Accepted):
nums = int(input())
input_list = [int(x) for x in input().split()]
input_list.sort(reverse=True)
max_num = input_list.pop(0)
if max_num < sum(input_list):
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
nums = list(map(int, input().split()))
nums.sort()
if nums[n-1] < sum(nums[:n]):
    print("Yes")
else:
    print("No")

Failing test case input:
10
1 0 1 10 16 18 34 110 6 3

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n = int(input())
nums = list(map(int, input().split()))
nums.sort()
if nums[n-1] < sum(nums[:n-1]):
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
L = [int(x) for x in input().split()]
L.sort(reverse = True)

if(L[0]> sum(L[1:])):
    print("No")
else:
    print("Yes")


Failing test case input:
4
2 0 2 0

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
N = int(input())
L = [int(x) for x in input().split()]
L.sort(reverse = True)

if(L[0] >= sum(L[1:])):
    print("No")
else:
    print("Yes")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
l = list(map(int, input().split()))
if sum(l)-max(l) > max(l):
    print('yes')
else:
    print('no')

Failing test case input:
10
1 0 1 10 16 18 34 110 6 3

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
n = int(input())
l = list(map(int, input().split()))
if sum(l)-max(l) > max(l):
    print('Yes')
else:
    print('No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input().strip())
arr = list(map(int, input().split()))

if max(arr) * 2 - sum(arr) > 0:
    print('No')
else:
    print('Yes')

Failing test case input:
4
3 8 4 1

Expected output:
No

Actual output:
Yes


Fixed submission (verdict: Accepted):
N = int(input().strip())
arr = list(map(int, input().split()))

if max(arr) * 2 - sum(arr) >= 0:
    print('No')
else:
    print('Yes')

Problem: p03136
Buggy submission (PyPy3 (7.3.0), verdict: Wrong Answer):
def main():
    N = input()
    L = map(int, input().split())
    a = max(L)
    b = sum(L) - a
    if a < b:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()


Failing test case input:
4
3 3 4 1

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
def main():
    N = input()
    L = list(map(int, input().split()))
    a = max(L)
    b = sum(L) - a
    if a < b:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
a = list(map(int, input().split()))
b = max(a)
c = sum(a)
if c >= b:
	print("Yes")
else:
	print("No")

Failing test case input:
4
1 1 2 0

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
N = int(input())
a = list(map(int, input().split()))
b = max(a)
a.pop(a.index(max(a)))
c = sum(a)
if c > b:
	print("Yes")
else:
	print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):



N = int(input())


l = list(map(int, input().split()))
max = max(l)



num = 0
for i in l:
    num=i+num
num = num-max


if num >= max:
    print("Yes")
else:
    print("No")





Failing test case input:
4
3 8 4 1

Expected output:
No

Actual output:
Yes


Fixed submission (verdict: Accepted):



N = int(input())


l = list(map(int, input().split()))
max = max(l)



num = 0
for i in l:
    num=i+num
num = num-max


if num > max:
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
L = list(map(int, input().split()))
sum_L = 0

for l in L:
    if l != max(L):
        sum_L += l

if max(L) < sum_L:
    print('Yes')
else:
    print('No')


Failing test case input:
4
6 6 1 0

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
N = int(input())
L = list(map(int, input().split()))
sum_L = sum(L) - max(L)

if max(L) < sum_L:
    print('Yes')
else:
    print('No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=input()
a=list(map(int,input().split()))
print("No" if sum(a)<2*max(a) else "Yes")

Failing test case input:
4
1 1 2 0

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n=input()
a=list(map(int,input().split()))
print("No" if sum(a)<=2*max(a) else "Yes")

Problem: p03136
Buggy submission (Python (3.8.2), verdict: Wrong Answer):

N = int(input())
L = list(map(int, input().split()))
mx = L.pop(L.index(max(L)))
if mx > sum(L):
    print("Yes")
else:
    print("No")
pass


Failing test case input:
4
6 1 1 -1

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):

N = int(input())
L = list(map(int, input().split()))
mx = L.pop(L.index(max(L)))
if mx < sum(L):
    print("Yes")
else:
    print("No")
pass

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = map(int, input().split())
L = map(int, input().split())

max_length = max(L)

if max_length < sum(L) - max_length:
    print('Yes')
else:
    print('No')

Failing test case input:
4
3 1 2 1

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
N = int(input())
L = list(map(int, input().split()))

max_length = max(L)

if max_length < sum(L) - max_length:
    print('Yes')
else:
    print('No')
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
L_ls = [int(i) for i in input().split()]
print(L_ls)
if sum(L_ls) - 2*max(L_ls) > 0:
  print("Yes")
else:
  print("No")

Failing test case input:
4
3 1 2 1

Expected output:
Yes


Actual output:
[3, 1, 2, 1]
Yes


Fixed submission (verdict: Accepted):
N = int(input())
L_ls = [int(i) for i in input().split()]
if sum(L_ls) - 2*max(L_ls) > 0:
  print("Yes")
else:
  print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
num = int(input())
l = list(map(int, input().split()))
max = l.pop(l.index(max(l)))
sum = 0
for i in range(len(l)):
    sum = sum + l[i]
if sum >= max:
    print('No')
else:
    print('Yes')


Failing test case input:
10
1 0 10 10 16 22 34 110 11 3

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
num = int(input())
l = list(map(int, input().split()))
max = l.pop(l.index(max(l)))
sum = 0
for i in range(len(l)):
    sum = sum + l[i]
if sum <= max:
    print('No')
else:
    print('Yes')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())

l = list(map(int, input().split()))
thr = sum(l) / 2

for i in range(n):
  if l[i] > thr:
    print("No")
    break
else: print("Yes")


Failing test case input:
4
3 8 4 1

Expected output:
No

Actual output:
Yes


Fixed submission (verdict: Accepted):
n = int(input())

l = list(map(int, input().split()))
thr = sum(l) / 2

for i in range(n):
  if l[i] >= thr:
    print("No")
    break
else: print("Yes")

Problem: p03136
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n = int(input())
l = list(map(int,input().split()))
m = max(l)
s = sum(l)
if m < s:
  print("Yes")
else:
  print("No")

Failing test case input:
10
1 0 10 5 8 12 34 100 11 3

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n = int(input())
l = list(map(int,input().split()))
m = max(l)
s = sum(l)-m
if m < s:
  print("Yes")
else:
  print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
inputs = [int(i) for i in input().split()]

max_item = max(inputs)
inputs.remove(max(inputs))
print('Yes' if max_item < sum(inputs) else 'NO')


Failing test case input:
10
0 0 1 9 0 14 33 100 -1 1

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
N = int(input())
inputs = [int(i) for i in input().split()]

print('Yes' if max(inputs) < sum(inputs) - max(inputs) else 'No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def f():
    n = int(input())
    l = list(map(int, input().split()))

    sum_l = sum(l)
    for a in l:
        if a >= sum_l:
            return "No"
    return "Yes"

print(f())

Failing test case input:
10
1 0 1 10 0 14 12 100 1 1

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
def f():
    n = int(input())
    l = list(map(int, input().split()))

    sum_l = sum(l)
    for a in l:
        if a >= sum_l - a:
            return "No"
    return "Yes"

print(f())
Problem: p03136
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
def resolve():
    n = int(input())
    L = map(int, input().split())
    M = max(L)
    R = sum(L) - M
    if R > M:
        print('Yes')
    else:
        print('No')
resolve()        

Failing test case input:
4
4 1 4 1

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
def resolve():
    input()
    L = list(map(int, input().split()))
    M = max(L)
    R = sum(L) - M
    if R > M:
        print('Yes')
    else:
        print('No')
resolve()

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
a=[int(x) for x in input().split()]
mx=max(a)
rem=sum(a)-mx
if mx > rem:
    print("No")
else:
    print("Yes")

Failing test case input:
4
3 8 4 1

Expected output:
No

Actual output:
Yes


Fixed submission (verdict: Accepted):
n=int(input())
a=[int(x) for x in input().split()]
mx=max(a)
rem=sum(a)-mx
if mx >= rem:
    print("No")
else:
    print("Yes")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,*L = map(int,open(0).read().split())
L.sort()
if sum(L[::-2]) < L[-1]:
    print("Yes")
else:
    print("No")

Failing test case input:
4
12 -5 -2 -1

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
N = int(input())
L = list(map(int,input().split()))
L.sort()
if sum(L[:-1]) > L[-1]:
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
print((lambda l:['No','Yes',input()][sum(l[:-1])>l[-1]])(sorted(list(map(int,input().split())))))


Failing test case input:
4
3 5 6 1

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
print((lambda l:['No','Yes'][sum(l[:-1])>l[-1]])(sorted(list(map(int,input().split()+input().split()))[1:])))

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
input()
L = list(map(int,input().split()))
if max(L) > sum(L)-max(L):
  print("Yes")
else:
  print("No")

Failing test case input:
4
2 0 2 -1

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
input()
L = list(map(int,input().split()))
if max(L) < sum(L)-max(L):
  print("Yes")
else:
  print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())


L = [int(i) for i in input().split()]



print(L)
s = sum(L)
m = max(L)
print(s)
print(m)





if (m < s - m):
    print('Yes')
else:
    print('No')
    

Failing test case input:
10
1 0 1 9 2 14 12 100 -1 1

Expected output:
No


Actual output:
[1, 0, 1, 9, 2, 14, 12, 100, -1, 1]
139
100
No


Fixed submission (verdict: Accepted):
N = int(input())




L = [int(i) for i in input().split()]



    




s = sum(L)
m = max(L)







if (m < s - m):
    print('Yes')
else:
    print('No')
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
import sys

def main():
    
    N = int(input())
    L = list(map(int, input().split()))
    longest = 0
    sum = 0
    for l in L:
        sum = sum + l
        if longest < l:
            longest = l
        
    if longest < (sum - longest):
        print("YES")
    else:
        print("NO")

if __name__ == '__main__':
    main()


Failing test case input:
4
-1 -2 9 -2

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
import sys

def main():
    
    N = int(input())
    L = list(map(int, input().split()))
    longest = 0
    sum = 0
    for l in L:
        sum = sum + l
        if longest < l:
            longest = l
        
    if longest < (sum - longest):
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
l=input().split()
for i in range(n):
    l[i] = int(l[i])

l.sort()
max = l.pop(-1)
sum = sum(l)
if sum>max:
    print("YES")
else:
    print("NO")

Failing test case input:
10
1 0 1 10 16 18 34 110 6 3

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
n = int(input())
l=input().split()
for i in range(n):
    l[i] = int(l[i])

l.sort()
max = l.pop(-1)
sum = sum(l)
if sum>max:
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
L = list(map(int, input().split()))
lmax = max(L)
suml = 0
for i in L:
    if i != lmax:
        suml += i

if lmax < suml:
    print('Yes')
else:
    print('No')

Failing test case input:
4
4 1 4 1

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
N = int(input())
L = list(map(int, input().split()))
lmax = max(L)
suml = sum(L) - lmax
if lmax < suml:
    print('Yes')
else:
    print('No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = int(input())
b = list(map(int, input().split()))
b.sort()
c = 0
for i in range(a-1):
    c += b[i]
if b[-1] < c:
    print("YES")
else:
    print("NO")


Failing test case input:
10
1 0 10 10 16 17 34 110 11 3

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
a = int(input())
b = list(map(int, input().split()))
b.sort()
c = 0
for i in range(a-1):
    c += b[i]
if b[a-1] < c:
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
lists = list(map(int,input().split()))

ma = max(lists)
if sum(lists) - ma >ma:
    print("YES")
else:
    print("NO")



Failing test case input:
10
1 0 10 10 16 17 34 110 6 3

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
n = int(input())
lists = list(map(int,input().split()))

ma = max(lists)
if sum(lists) - ma >ma:
    print("Yes")
else:
    print("No")
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
L = list(map(int,input().split()))
L.sort()
L.reverse()
sum = 0
for i in range(1,N):
    sum += L[i]
if sum < L[0]:
    print("No")
else:
    print("Yes")

Failing test case input:
4
1 1 2 0

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
N = int(input())
L = list(map(int,input().split()))
L.sort()
L.reverse()
sum = 0
for i in range(1,N):
    sum += L[i]
if sum <= L[0]:
    print("No")
else:
    print("Yes")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = input()
L = sorted(list(map(int, input().split())))
print("Yes" if sum(L[:-1]) < L[-1] * 2 else "No")

Failing test case input:
4
-4 0 4 -2

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
N = input()
L = sorted(list(map(int, input().split())))
print("Yes" if (sum(L[:-1]) > L[-1]) else "No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
if __name__ == '__main__':
    N = int(input())

    L_list = list(map(int, input().split()))

    max_L =  max(L_list)

    sum_L_without_max = 0
    for L in L_list:
        if L != max_L:
            sum_L_without_max += L

    if max_L < sum_L_without_max:
        print('Yes')
    else:
        print('No')


Failing test case input:
4
4 1 4 1

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
if __name__ == '__main__':
    N = int(input())

    L_list = list(map(int, input().split()))

    max_L = max(L_list)

    sum_L = 0
    for L in L_list:
        sum_L += L

    if max_L < sum_L - max_L:
        print('Yes')
    else:
        print('No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
input()
li = list(map(int,input().split()))

max = 0
ignore = 0
temp = 0

for i, value in enumerate(li):
  if value > max:
    max = value
    ignore = i

for i, value in enumerate(li):
  if i == ignore:
    continue
  else:
    temp += value
    
if max < temp:
  print("YES")
else:
  print("NO")

Failing test case input:
4
3 8 4 1

Expected output:
No

Actual output:
NO


Fixed submission (verdict: Accepted):
input()
li = list(map(int,input().split()))

max = 0
ignore = 0
temp = 0

for i, value in enumerate(li):
  if value > max:
    max = value
    ignore = i

for i, value in enumerate(li):
  if i == ignore:
    continue
  else:
    temp += value
    
if max < temp:
  print("Yes")
else:
  print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
a = [int(i) for i in input().split()]
if(max(a) > (sum(a) - max(a))):
   print("No")
else:
   print("Yes")

Failing test case input:
4
2 0 2 0

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n = int(input())
a = [int(i) for i in input().split()]
if(max(a) >= (sum(a) - max(a))):
   print("No")
else:
   print("Yes")
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
d = list(map(int,input().split()))

dmax = max(d)

dsum = sum(d)

tan = dsum - dmax
print(dmax)
print(tan)
if tan > dmax:
  print("Yes")
else:
  print("No")

Failing test case input:
10
1 0 10 10 8 12 34 110 11 3

Expected output:
No


Actual output:
110
89
No


Fixed submission (verdict: Accepted):
n = int(input())
d = list(map(int,input().split()))

dmax = max(d)

dsum = sum(d)

tan = dsum - dmax

if tan > dmax:
  print("Yes")
else:
  print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
L = [int(i) for i in input().split()]

L.sort()
if L[N-1] < sum(L[0:N-1]):
    print('yes')
else:
    print('No')


Failing test case input:
4
3 3 4 1

Expected output:
Yes


Actual output:
yes


Fixed submission (verdict: Accepted):
N = int(input())
L = [int(i) for i in input().split()]

L.sort()
if L[N-1] < sum(L[0:N-1]):
    print('Yes')
else:
    print('No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
L = list(map(int, input().split()))
L.sort(reverse=True)
if L[0] > sum(L[1:]):
    print('Yes')
else:
    print('No')

Failing test case input:
4
-1 2 1 -1

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n = int(input())
l = list(map(int, input().split()))
if max(l) < sum(l) - max(l):
    print('Yes')
else:
    print('No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
t = list(map(int, input().split()))
if max(t) * 2 > sum(t):
	print("Yes")
else:
	print("No")

Failing test case input:
4
10 1 1 0

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n = int(input())
t = list(map(int, input().split()))
if max(t) * 2 < sum(t):
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
l=list(map(int,input().split()))
L=max(l)
other=sum(l)-L
if other<L:
  print('No')
else:
  print('Yes')

Failing test case input:
4
2 0 2 0

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n=int(input())
l=list(map(int,input().split()))
L=max(l)
other=sum(l)-L
if other<=L:
  print('No')
else:
  print('Yes')

Problem: p03136
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
from sys import stdin
 
n = int(stdin.readline().rstrip())
data = list(map(int, stdin.readline().rstrip().split()))
 
def is_s(hens):
  m = max(hens)
  hens.remove(m)
  if m < sum(hens):
  	return True
  else:
    return False
 
print(is_s(data))

Failing test case input:
4
0 1 1 -1

Expected output:
No


Actual output:
False


Fixed submission (verdict: Accepted):
from sys import stdin
 
n = int(stdin.readline().rstrip())
data = list(map(int, stdin.readline().rstrip().split()))
 
def is_s(hens):
  m = max(hens)
  hens.remove(m)
  if m < sum(hens):
  	return "Yes"
  else:
    return "No"
 
print(is_s(data))
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
x = sorted(list(map(int, input().split())))
sum = 0
for i in range(0, len(x) - 1):
    sum += x[i]
if sum > x[len(x) - 1]:
    print('Yes')
else:
    print('NO')

Failing test case input:
4
4 0 2 0

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
n = int(input())
x = sorted(list(map(int, input().split())))
sum = 0
if len(x) < n:
    print('No')
else:
    for i in range(0, len(x) - 1):
        sum += x[i]
    if sum > x[len(x) - 1]:
        print('Yes')
    else:
        print('No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
L = list(map(int,input().split()))
kekka = 0
for i in range(n):
  if 2*L[i] > sum(L):
    kekka = 1
    break
    
if kekka == 1:
  print('No')
else:
  print('Yes')

Failing test case input:
4
1 1 2 0

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n = int(input())
L = list(map(int,input().split()))
kekka = 0
for i in range(n):
  if 2*L[i] >= sum(L):
    kekka = 1
    break
    
if kekka == 1:
  print('No')
else:
  print('Yes')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
B = list(map(int, input().split(" ")))

max_b = max(B)
if sum(B) - max_b > max_b:
    print("YES")
else:
    print("NO")


Failing test case input:
4
3 6 0 0

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
N = int(input())
B = list(map(int, input().split(" ")))

max_b = max(B)
if sum(B) - max_b > max_b:
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,ans,l=int(input()),"Yes",list(map(int,input().split()))
for i in l:
  if sum(l)<i*2:ans="No"
print(ans)

Failing test case input:
4
1 1 2 0

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n,ans,l=int(input()),"Yes",list(map(int,input().split()))
for i in l:
  if sum(l)<=i*2:ans="No"
print(ans)

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


index = int(input('input num : '))


maximum = 0
other = 0
inputList = input().split()
for i in range(index):
    tmp = int(inputList[i])
    if tmp > maximum:
        maximum = tmp
        other = other + maximum
    else:
        other = other + tmp

if maximum < other - maximum:
    print("Yes")
else:
    print("No")

Failing test case input:
4
-2 1 2 -1

Expected output:
No


Actual output:
input num : No


Fixed submission (verdict: Accepted):


index = int(input())


maximum = 0
other = 0
inputList = input().split()
for i in range(index):
    tmp = int(inputList[i])
    if tmp > maximum:
        maximum = tmp
        other = other + maximum
    else:
        other = other + tmp

if maximum < other - maximum:
    print("Yes")
else:
    print("No")
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
L = list(map(int,input().split()))
large = max(L)
gou = 0
for i in range(N):
	gou = gou + L[i]
if large < gou:
	print ("Yes")
else:
	print ("No")

Failing test case input:
4
5 4 1 -1

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
N = int(input())
L = sorted(list(map(int,input().split())),reverse=True)
gou = 0
for i in range(1,N):
	gou += L[i]
if L[0] < gou:
	print ("Yes")
else:
	print ("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
L_list = list(map(int, input().split()))

if max(L_list) * 2 > sum(L_list):
    print('Yes')
else:
    print('No')

Failing test case input:
4
-4 0 4 -2

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
N = int(input())
L_list = list(map(int, input().split()))

if max(L_list) * 2 < sum(L_list):
    print('Yes')
else:
    print('No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
l= list(map(int, input().split()))
if sum(l)-2*max(l)>=0:
    print('Yes')
else:
    print('No')

Failing test case input:
4
3 8 4 1

Expected output:
No

Actual output:
Yes


Fixed submission (verdict: Accepted):
n=int(input())
l= list(map(int, input().split()))
if sum(l)>2*max(l):
    print('Yes')
else:
    print('No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = (int(i) for i in input().split())  
L = [int(i) for i in input().split()] 
mx = max(L)
S = sum(L)

if mx < S-mx:
    print("yes")
else:
    print("no")

Failing test case input:
4
4 -5 -1 0

Expected output:
No


Actual output:
no


Fixed submission (verdict: Accepted):
N = (int(i) for i in input().split())  
L = [int(i) for i in input().split()] 
mx = max(L)
S = sum(L)

if mx < S-mx:
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
L =  input().split()
sum_len = 0

L_i = [int(s) for s in L]
print(L_i)
L_i.sort()

for i in range(N-1):
    sum_len = sum_len + int(L_i[i])

if sum_len > int(L_i[N-1]):
    print('Yes')
else :
    print('No')

Failing test case input:
10
0 0 1 10 0 14 33 001 -1 0

Expected output:
No


Actual output:
[0, 0, 1, 10, 0, 14, 33, 1, -1, 0]
No


Fixed submission (verdict: Accepted):
N = int(input())
L =  input().split()
sum_len = 0

L_i = [int(s) for s in L]
L_i.sort()

for i in range(N-1):
    sum_len = sum_len + int(L_i[i])

if sum_len > int(L_i[N-1]):
    print('Yes')
else :
    print('No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
polys = list(map(int, input().split(' ')))

if sum(polys) - max(polys) > max(polys):
        print('True')
else:
        print('False')

Failing test case input:
4
6 2 1 -1

Expected output:
No


Actual output:
False


Fixed submission (verdict: Accepted):
n = int(input())
polys = list(map(int, input().split(' ')))

if sum(polys) - max(polys) > max(polys):
        print('Yes')
else:
        print('No')
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def main():
    n = int(input())
    l = list(map(int,input().split()))
    s = 0
    lmax = max(l)

    l.remove(lmax)

    for i in l:
        s += i
    if lmax < s :
        print("YES")
    else:
        print("NO")

if __name__ == '__main__':
    main()

Failing test case input:
4
3 3 4 1

Expected output:
Yes


Actual output:
YES


Fixed submission (verdict: Accepted):
def main():
    n = int(input())
    l = list(map(int,input().split()))
    s = 0
    lmax = max(l)

    l.remove(lmax)

    for i in l:
        s += i
    if lmax < s :
        print("Yes")
    elif lmax >= s :
        print("No")

if __name__ == '__main__':
    main()

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
s = int(input())
A = list(map(int, input().split())) 
m = max(A)
if sum(A) - int(m) > int(m):
    print("Yes")
elif sum(A) - int(m) <= int(m):
    print("NO")

Failing test case input:
10
0 0 1 9 0 14 33 001 -1 1

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
s = int(input())
A = list(map(int, input().split())) 
m = max(A)
if sum(A) - int(m) > int(m):
    print("Yes")
elif sum(A) - int(m) <= int(m):
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
inputs = [int(i) for i in input().split()]

print('Yes' if max(inputs) < sum(inputs) - max(inputs) else 'NO')


Failing test case input:
4
3 -9 -1 0

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
N = int(input())
inputs = [int(i) for i in input().split()]

print('Yes' if max(inputs) < sum(inputs) - max(inputs) else 'No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = input()
L = list(map(int,input().split()))
Ma1 = max(L)
Su1 = sum(L)
if Ma1 >= Su1 - Ma1:
  print('Yes')
else:
  print('No')

Failing test case input:
4
3 5 6 1

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
N = input()
L = list(map(int,input().split()))
Ma1 = max(L)
 
Su1 = sum(L)
 
hikaku = Su1 - Ma1
 
if hikaku > Ma1:
  print('Yes')
else:
  print('No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
ls = map(int, input().split())

cur_longest = 0
sum_others = 0

for l in ls:
    sum_others += l
    if l > cur_longest:
        sum_others -= l
        sum_others += cur_longest
        cur_longest = l

print(cur_longest, sum_others)

if cur_longest >= sum_others:
    print('No')
else:
    print('Yes')



Failing test case input:
4
8 -5 -2 0

Expected output:
No


Actual output:
8 -7
No


Fixed submission (verdict: Accepted):
n = int(input())
ls = map(int, input().split())

cur_longest = 0
sum_others = 0

for l in ls:
    sum_others += l
    if l > cur_longest:
        sum_others -= l
        sum_others += cur_longest
        cur_longest = l

if cur_longest >= sum_others:
    print('No')
else:
    print('Yes')
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):



N = int(input())


l = map(int, input().split())
max = max(l)
num = 0
for i in l:
    num=i[0]+num
num = num-max
if num > max:
    print("Yes")
else:
    print("No")
print(max)
print(num)





Failing test case input:
4
4 -5 -1 0

Expected output:
No


Actual output:
No
4
-4


Fixed submission (verdict: Accepted):



N = int(input())


l = list(map(int, input().split()))
max = max(l)



num = 0
for i in l:
    num=i+num
num = num-max


if num > max:
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
l=list(map(int,input().split()))
l.sort()
if l[0]-(sum(l)-l[0])>0:
    print("No")
else:
    print("Yes")

Failing test case input:
10
0 0 1 10 0 14 33 001 -1 1

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n=int(input())
l=list(map(int,input().split()))
l.sort()
l.reverse()
if l[0]-(sum(l)-l[0])>=0:
    print("No")
else:
    print("Yes")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):



def main():
    
    n = int(input())
    ls = list(map(int, input().split()))

    max_val = max(ls)
    flag = 0
    total = 0
    for i in range(n):
        if ls[i] == max_val:
            if flag == 0:
                flag == 1
                pass
            else:
                total += ls[i]
        else:
            total += ls[i]

    if max_val < total:
        print("Yes")
    else:
        print("No")



if __name__ == "__main__":
    main()


Failing test case input:
4
3 1 3 1

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):



def main():
    
    n = int(input())
    ls = list(map(int, input().split()))

    max_val = max(ls)
    flag = 0
    total = 0
    for i in range(n):
        if ls[i] == max_val:
            if flag == 0:
                flag = 1
                pass
            else:
                total += ls[i]
        else:
            total += ls[i]

    if max_val < total:
        print("Yes")
    else:
        print("No")



if __name__ == "__main__":
    main()

Problem: p03136
Buggy submission (Python (3.8.2), verdict: Wrong Answer):

polynum = int(input())
length = list(map(int,input().split()))


most_l = max(length)
othersum = sum(length) - most_l
print(most_l)
print(othersum)
if othersum > most_l:
    print("Yes")
else:
    print("No")

Failing test case input:
4
4 -2 0 0

Expected output:
No


Actual output:
4
-2
No


Fixed submission (verdict: Accepted):

polynum = int(input())
length = list(map(int,input().split()))


most_l = max(length)
othersum = sum(length) - most_l
if othersum > most_l:
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
l=list(map(int,input().split()))
print('YNeos'[sum(l)>=max(l)::2])

Failing test case input:
4
3 1 3 0

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
n=int(input())
l=list(map(int,input().split()))
print('YNeos'[sum(l)-max(l)<=max(l)::2])
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
from sys import stdin
N = int(stdin.readline().rstrip())
L = [int(x) for x in stdin.readline().rstrip().split()]

if max(L) < sum(L) - max(L):
    print('YES')
else:
    print('NO')


Failing test case input:
4
5 -5 -1 0

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
from sys import stdin
N = int(stdin.readline().rstrip())
L = [int(x) for x in stdin.readline().rstrip().split()]

if max(L) < sum(L) - max(L):
    print('Yes')
else:
    print('No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
_ = input()
n = [int(i) for i in input().split()]
print("YNeos"[0>sum(n)-max(n)*2::2])

Failing test case input:
4
2 0 2 0

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
_ = input()
n = [int(i) for i in input().split()]
print("YNeos"[0>=sum(n)-max(n)*2::2])

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a= input()
b = input().split()
s = 0
for i in range(0,len(b)):
    s+=int(b[i])
if s-int(max(b))>int(max(b)):
    print("Yes")
else:
    print("No")

Failing test case input:
10
1 0 1 10 1 14 12 100 1 1

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
a= input()
b = input().split()
b = [int(s) for s in b]
s = 0
for i in range(0,len(b)):
    s+=int(b[i])
if s-int(max(b))>int(max(b)):
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
li = list(map(int,input().split()))
lmax = max(li)
a = sum(li) - lmax
if a > lmax:
  print("Yes")
else:
  print("No")

Failing test case input:
4
3 1 2 1

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
N = int(input())
li = [int(x) for x in input().split()]
lmax = max(li)
a = sum(li) - lmax
if a > lmax:
  print("Yes")
else:
  print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
l=list(map(int,input().split()))
l.sort()
sum=0
for i in range(1,n):
    sum+=l[i]
if l[0]<sum:
    print('Yes')
else:
    print('No')

Failing test case input:
4
4 0 2 0

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n=int(input())
l=list(map(int,input().split()))
l.sort()
l.reverse()
sum=0
for i in range(1,n):
    sum+=l[i]
if l[0]<sum:
    print('Yes')
else:
    print('No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
i_list = list(map(int,input().split()))
i_list = sorted(i_list)

line_sum = 0
for i in i_list[:-2]:
  line_sum += i

if i_list[-1] < line_sum:
  print("Yes")
else:
  print("No")





Failing test case input:
4
3 5 6 1

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
N = int(input())
i_list = list(map(int,input().split()))
i_list = sorted(i_list)

line_sum = 0
for i in i_list:
  line_sum += i

if max(i_list) < line_sum - max(i_list):
  print("Yes")
else:
  print("No")
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
t=list(map(int,input().split(" ")))

t_max=max(t)

j=0
t_sum=0
while j<=n-1:
    t_sum+=t[j]
    j+=1
        
if t_sum>2*t_max:
    print("YES")
else:
    print("NO")

Failing test case input:
4
-1 1 1 -1

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
n=int(input())
t=list(map(int,input().split(" ")))

t_max=max(t)

j=0
t_sum=0
while j<=n-1:
    t_sum+=t[j]
    j+=1
        
if t_sum>2*t_max:
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())

l = list(map(int, input().split()))
thr = sum(l) / 2

for i in range(n):
  if l[i] > thr:
    print("No")
else: print("Yes")

Failing test case input:
4
12 -5 -2 -1

Expected output:
No


Actual output:
No
Yes


Fixed submission (verdict: Accepted):
n = int(input())

l = list(map(int, input().split()))
thr = sum(l) / 2

for i in range(n):
  if l[i] >= thr:
    print("No")
    break
else: print("Yes")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = input()
ls = [int(i) for i in input().split()]

mx = max(ls)
sm = sum(ls)

smt = sm - mx

if smt >= mx:
    print('Yes')
else:
  print('No')

Failing test case input:
4
3 8 4 1

Expected output:
No

Actual output:
Yes


Fixed submission (verdict: Accepted):
n = input()
ls = [int(i) for i in input().split()]

mx = max(ls)
sm = sum(ls)

smt = sm - mx

if smt > mx:
    print('Yes')
else:
  print('No')

Problem: p03136
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
a = [int(i) for i in input().split()]
if sum(a) > max(a) * 2:
  print('Yes')
else:
  print('No')

Failing test case input:
4
3 1 3 0

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
_ = input()
a = [int(i) for i in input().split()]
if sum(a) > max(a) * 2:
  print('Yes')
else:
  print('No')

Problem: p03136
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n = int(input())
l = [int(x) for x in input().split()]

max_index = l.index(max(l))

sum_length = 0

for x in range(n):
	if x == max_index:
		continue
	sum_length += l[x]

print ("YES") if sum_length > max(l) else print ("NO")

Failing test case input:
10
1 0 10 10 8 12 34 100 11 3

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
n = int(input())
l = [int(x) for x in input().split()]

max_index = l.index(max(l))

sum_length = 0

for x in range(n):
	if x == max_index:
		continue
	sum_length += l[x]

print ("Yes") if sum_length > max(l) else print ("No")

Problem: p03136
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
a=input()
b=list(map(int,input().split()))
b.sort()
if sum(b)-max(b)-max(b)<0:
  print("Yes")
else:
  print("No")

Failing test case input:
4
12 -9 -2 -1

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
a=input()
b=list(map(int,input().split()))
b.sort()
if sum(b)-max(b)-max(b)>0:
  print("Yes")
else:
  print("No")
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
lengths = list(map(int, input().split(' ')))
total = 0
longest = 0
for i in lengths:
  total += i
  if (i > longest):
    longest = i
possible = True
if (total - longest) < longest:
    possible = False
   
if possible:
  print("Yes")
else:
  print("No")

Failing test case input:
4
3 8 4 1

Expected output:
No

Actual output:
Yes


Fixed submission (verdict: Accepted):
n = int(input())
lengths = list(map(int, input().split(' ')))
total = 0
longest = 0
for i in lengths:
  total += i
  if (i > longest):
    longest = i
possible = True
if (total - longest) <= longest:
    possible = False
   
if possible:
  print("Yes")
else:
  print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
l = list(map(int, input().split()))
l.sort()
cnt = 0
for i in l[:n - 1]:
    cnt += 1
    
if cnt > l[n - 1]:
    print("Yes")
else:
    print("No")
    

Failing test case input:
4
6 6 1 0

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
n = int(input())
l = list(map(int, input().split()))
l.sort()
cnt = 0
for i in l[:n - 1]:
    cnt += i
    
if cnt > l[n - 1]:
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


N = int(input())
L = input().split()
L_num = []

for i in range(len(L)):
    L_num.append(int(L[i]))

L_num.sort()

total = 0
for j in range(len(L) - 1):
    total += L_num[j]

if total <= L_num[N-1]:
    print("No")
else:
    print("Yes")

print(total)
print(L_num[N-1])


Failing test case input:
10
1 0 1 10 1 14 12 100 1 1

Expected output:
No


Actual output:
No
41
100


Fixed submission (verdict: Accepted):


N = int(input())
L = input().split()
L_num = []

for i in range(len(L)):
    L_num.append(int(L[i]))

L_num.sort()

total = 0
for j in range(len(L) - 1):
    total += L_num[j]

if total <= L_num[N-1]:
    print("No")
else:
    print("Yes")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


n = int(input())
l = list(map(int, input().split()))
m = sum(l)
a = 0
for i in range(n):
    if l[i] >= m - l[i]:
        print("NO")
        a = 1
        break
if a == 0:
    print("YES")

Failing test case input:
10
1 0 1 10 0 14 12 100 1 1

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):


n = int(input())
l = list(map(int, input().split()))
m = sum(l)
a = 0
for i in range(n):
    if l[i] >= m - l[i]:
        print("No")
        a = 1
        break
if a == 0:
    print("Yes")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
L = list(map(int, input().split()))
L.sort(reverse=True)
if 2*max(L) > sum(L):
    print('Yes')
else:
    print('No')

Failing test case input:
4
3 5 0 1

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
n = int(input())
l = list(map(int, input().split()))
if max(l) < sum(l) - max(l):
    print('Yes')
else:
    print('No')
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N=int,input()
list=map(int,input().split())
list2=list
a=max(list)
b=sum(list2)
if a < b-a :
    print('Yes')
else :
    print('No')


Failing test case input:
4
6 6 1 0

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
N=int(input())
listL=list(map(int,input().split()))
a,b=max(listL),sum(listL)
if a < b-a :
    print('Yes')
else :
    print('No')

Problem: p03136
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N = int(input())
edges = list(map(int, input().split()))

print( "Yes" if edges[-1] > sum(edges[:-1]) else "No" )

Failing test case input:
4
3 -9 -1 0

Expected output:
No


Actual output:
Yes


Fixed submission (verdict: Accepted):
N = int(input())
edges = sorted(list(map(int, input().split())))

print( "Yes" if edges[-1] < sum(edges[:-1]) else "No" )

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
L = input().split()
L = [int(i) for i in L]
L = sorted(L, reverse=True)
hen = 0

for i in range(1, N):
    hen += L[i]
if L[0] < hen:
    print('YES')
else:
    print('NO')

Failing test case input:
4
4 -2 0 0

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
N = int(input())
L = input().split()
L = [int(i) for i in L]
L = sorted(L, reverse=True)
hen = 0

for i in range(1, N):
    hen += L[i]
if L[0] < hen:
    print('Yes')
else:
    print('No')

Problem: p03136
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
n = int(input())
l = list(map(int,input().split(" ")))

print(sum(l))
m=max(l)
if m - (sum(l)-m):
    print("Yes")
else:
    print("No")

Failing test case input:
10
1 0 1 10 0 14 12 100 1 1

Expected output:
No


Actual output:
140
Yes


Fixed submission (verdict: Accepted):
n = int(input())
l = list(map(int,input().split(" ")))

m=max(l)
if m < (sum(l)-m):
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
L = list(map(int, input().split()))
lmax = max(L)
suml = 0
for i in L:
    if i != lmax:
        suml += i

if lmax < suml:
    print('Yes')
    exit()
print('No')

Failing test case input:
4
4 3 4 1

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
N = int(input())
L = list(map(int, input().split()))
lmax = max(L)
suml = sum(L) - lmax
if lmax < suml:
    print('Yes')
else:
    print('No')
Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):




def solveProblem(lengthList):
	sortedList = sorted(lengthList,reverse=True)
	allIntegerSum = sum(lengthList)
	maxInteger = sortedList.pop(0)
	anotherIntegerSum = allIntegerSum - maxInteger
	if maxInteger < anotherIntegerSum:
		answer="YES"
	else:
		answer="NO"
	return answer

if __name__ == '__main__':
	_ = input()
	lList = list(map(int,input().strip().split(' ')))
	solution = solveProblem(lList)
	print("{}".format(solution))


Failing test case input:
10
1 0 1 9 2 14 12 100 0 1

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):




def solveProblem(lengthList):
	sortedList = sorted(lengthList,reverse=True)
	allIntegerSum = sum(lengthList)
	maxInteger = sortedList.pop(0)
	anotherIntegerSum = allIntegerSum - maxInteger
	if maxInteger < anotherIntegerSum:
		answer="Yes"
	else:
		answer="No"
	return answer

if __name__ == '__main__':
	_ = input()
	lList = list(map(int,input().strip().split(' ')))
	solution = solveProblem(lList)
	print("{}".format(solution))

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N = int(input())
hen_list = list(map(int,input().split()))
if sum(hen_list)-max(hen_list) > 0:
    print("Yes")
else:
    print("No")

Failing test case input:
10
1 8 10 5 8 12 34 100 11 3

Expected output:
No

Actual output:
Yes


Fixed submission (verdict: Accepted):
N = int(input())
hen_list = list(map(int,input().split()))
if sum(hen_list)-2*max(hen_list) > 0:
    print("Yes")
else:
    print("No")

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n = int(input())
x = sorted(list(map(int, input().split())))
sum = 0
if len(x) < 3:
    print('NO')
for i in range(0, len(x) - 1):
    sum += x[i]
if sum > x[len(x) - 1]:
    print('Yes')
else:
    print('NO')

Failing test case input:
4
12 -5 -2 -1

Expected output:
No


Actual output:
NO


Fixed submission (verdict: Accepted):
n = int(input())
x = sorted(list(map(int, input().split())))
sum = 0
if len(x) < n:
    print('No')
else:
    for i in range(0, len(x) - 1):
        sum += x[i]
    if sum > x[len(x) - 1]:
        print('Yes')
    else:
        print('No')

Problem: p03136
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n=int(input())
l=list(map(int,input().split()))
for i in range(n):
  if l[i]*2 <=sum(l):
    print("No")
    exit()
print("Yes")

Failing test case input:
4
6 6 1 0

Expected output:
Yes


Actual output:
No


Fixed submission (verdict: Accepted):
n=int(input())
l=list(map(int,input().split()))

if max(l)*2 >=sum(l):
  print("No")
  exit()
print("Yes")