Problem:
 Score : 200 points    Problem Statement Determine if an N -sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.  You can use the following theorem:  Theorem : an N -sided polygon satisfying the condition can be drawn if and only if the longest side is strictly shorter than the sum of the lengths of the other N-1 sides.      Constraints  All values in input are integers.  3 \leq N \leq 10  1 \leq L_i \leq 100         Input Input is given from Standard Input in the following format:  N  L_1  L_2  ...  L_N       Output If an N -sided polygon satisfying the condition can be drawn, print Yes ; otherwise, print No .        Sample Input 1 4
3 8 5 1      Sample Output 1 Yes  Since 8 < 9 = 3 + 5 + 1 , it follows from the theorem that such a polygon can be drawn on a plane.       Sample Input 2 4
3 8 4 1      Sample Output 2 No  Since 8 \geq 8 = 3 + 4 + 1 , it follows from the theorem that such a polygon cannot be drawn on a plane.       Sample Input 3 10
1 8 10 5 8 12 34 100 11 3      Sample Output 3 No

Solution (Python):
import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline
n = int(input())
a = list(map(int,input().split()))
a.sort()
l = a.pop()
if sum(a) <= l:
        print("No")
else:
        print("Yes")

Solution (Python):
N = int(input())
L = list(map(int, input().split(" ")))

L.sort()

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

Solution (Python):
n = int(input())
a = list(map(int,input().split()))
a.sort()
if sum(a[0:n-1]) > a[n-1]:
    print("Yes")
else:
    print("No")

Solution (Python):

from collections import defaultdict
import math
def LI(): return list(map(int, input().split()))
def II(): return int(input())
def LS(): return input().split()
def S(): return input()
def IIR(n): return [II() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
mod = 1000000007


"""
t,x = LI()
print(t/x)
"""


n = II()
a = LI()
m = max(a)
if m >= sum(a)-m:
    print("No")
else:
    print("Yes")

Solution (Python):
n = int(input())
x = [int(i) for i in input().split()]
if 2*max(x)<sum(x): print("Yes")
else: print("No")

Solution (Python):
n = int(input())
lll = list(map(int, input().split()))
ml = max(lll)
sl = sum(lll) - ml
if ml >= sl:
    print('No')
else:
    print('Yes')

Solution (Python):
N = int(input())
Ls = sorted(map(int, input().split()))
if Ls[-1] < sum(Ls) - Ls[-1]:
    print('Yes')
else:
    print('No')