Problem:
 Score : 200 points    Problem Statement Raccoon is fighting with a monster.  The health of the monster is H .  Raccoon can use N kinds of special moves. Using the i -th move decreases the monster's health by A_i .
There is no other way to decrease the monster's health.  Raccoon wins when the monster's health becomes 0 or below.  If Raccoon can win without using the same move twice or more, print Yes ; otherwise, print No .      Constraints  1 \leq H \leq 10^9  1 \leq N \leq 10^5  1 \leq A_i \leq 10^4  All values in input are integers.         Input Input is given from Standard Input in the following format:  H  N  A_1  A_2  ...  A_N       Output If Raccoon can win without using the same move twice or more, print Yes ; otherwise, print No .        Sample Input 1 10 3
4 5 6      Sample Output 1 Yes  The monster's health will become 0 or below after, for example, using the second and third moves.       Sample Input 2 20 3
4 5 6      Sample Output 2 No       Sample Input 3 210 5
31 41 59 26 53      Sample Output 3 Yes       Sample Input 4 211 5
31 41 59 26 53      Sample Output 4 No

Solution (Python):
H, N = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]

if sum(A) >= H:
    ans = "Yes"
else:
    ans = "No"
print(ans)

Solution (Python):
H, N = [int(i) for i in input().split()]
A = sum([int(i) for i in input().split()])

print("Yes" if H<=A else "No")

Solution (Python):


from collections import deque, defaultdict
import itertools as ite
import sys
import math
from decimal import *

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

H, N = map(int, raw_input().split())
S = sum(map(int, raw_input().split()))
print "Yes" if H <= S else "No"

Solution (Python):
h,n=map(int,input().split())
A=[int(i) for i in input().split()]
print("Yes" if sum(A)>=h else "No")

Solution (Python):
H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
k = sum(A)
if H <= k:
  print("Yes")
else:
  print("No")

Solution (Python):
h,n = map(int,input().split())
a = list(map(int,input().split()))
s = sum(a)
if h>s:
    print('No')
else:
    print('Yes')

Solution (Python):
A, N = map(int, input().split())
B = list(map(int, input().split()))
print("Yes" if sum(B) >= A else "No")

Solution (Python):
import sys
input = sys.stdin.readline
H, N = map(int, input().split())
a = list(map(int, input().split()))
if sum(a) >= H:
  print("Yes")
else: print("No")

Solution (Python):

H,N = map(int,input().split())
A=list(map(int,input().split()))

if sum(A)>=H:
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))

if sum(A) >= H:
    print("Yes")
else:
    print("No")

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))

if sum(a) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
h,n = map(int, input().split())
a = list(map(int, input().split()))

if h<=sum(a):
    print('Yes')
else:
    print('No')

Solution (Python):
H,N=map(int,input().split())
A=list(map(int,input().split()))
if H<=sum(A):
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

h,n=MAP()
a=LIST()
b=sum(a)
if h<=b:
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int, input().split())
*A, = map(int, input().split())

print('Yes' if H <= sum(A) else 'No')

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
print("Yes" if sum(A) >= H else "No")

Solution (Python):
H, N = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
print('Yes' if sum(A) >= H else 'No')

Solution (Python):
H,N= map(int,input().split())
A = list(map(int,input().split()))
A.sort()

if sum(A[:N]) >= H:
    print('Yes')
else:
    print('No')

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))

print("Yes" if sum(A) >= H else "No")

Solution (Python):
def main():
    H, N = (int(i) for i in input().split())
    A = [int(i) for i in input().split()]
    print("Yes" if H <= sum(A) else "No")


if __name__ == '__main__':
    main()

Solution (Python):
import math
h,n = map(int, input().split())
a = list(map(int, input().split()))
if sum(a) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
H, N = map(int, input().split())
A = [int(i) for i in input().split()]

if sum(A) >= H :
  print('Yes')
else :
  print('No')

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))
print("Yes" if sum(A) >= H else "No")

Solution (Python):
H, N = map(int, input().split())
A = list(map(int, input().split()))

print('Yes' if sum(A) >= H else 'No')

Solution (Python):
h,a=map(int,input().split())
b=list(map(int,input().split()))

if h<=sum(b):
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    H, N = [int(x) for x in input().split()]
    A = [int(x) for x in input().split()]

    if sum(A) >= H:
        print("Yes")
    else:
        print("No")


    
    
    

if __name__ == '__main__':
    main()

Solution (Python):

from math import ceil
H, N = map(int, input().split())
A = list(map(int, input().split()))
print("Yes" if H <= sum(A) else "No")

Solution (Python):
def main():
    H, N = map(int, input().split())
    A = list(map(int, input().split()))
    print('Yes' if H <= sum(A) else 'No')

main()

Solution (Python):
h, n = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
if h > sum(a):
    print("No")
else:
    print("Yes")

Solution (Python):
H, N = list(map(int, input().split()))
A = list(map(int, input().split()))


ans = "No"
if sum(A) >= H:
    ans = "Yes"

print(ans)

Solution (Python):
h,n = map(int,input().split())
a = list(map(int,input().split()))
if sum(a) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):



def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10 ** 6)

    h, n = map(int, input().split())
    a = list(map(int, input().split()))

    if sum(a) >= h:
        print('Yes')
        exit(0)
    print('No')


if __name__ == '__main__':
    main()

Solution (Python):
H, N = map(int, raw_input().split())
A = map(int, raw_input().split())

print "Yes" if H<=sum(A) else "No"

Solution (Python):
h,n = map(int, input().split())
a = list(map(int, input().split()))
if h <= sum(a):
    print("Yes")
else:
    print("No")

Solution (Python):
h,n = map(int,input().split())
A = list(map(int,input().split()))
if sum(A)>=h:
    print("Yes")
else:
    print("No")

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))
S = sum(A)
if S>=H:
    print('Yes')
else:
    print('No')

Solution (Python):

h,n = map(int,input().split())
lst1 = list(map(int,input().split()))

if h > sum(lst1):
    print("No")
else:
    print("Yes")

Solution (Python):
a,b = map(int,input().split())
c = list(map(int,input().split()))
if a <= sum(c):
  print('Yes')
else:
  print('No')

Solution (Python):
import sys
import fractions
import math
MAX_INT = int(10e12)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

H, N = IL()
a = IL()
num = sum(a)

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

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))

if sum(a) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):
H,N = map(int,input().split())
A = list(map(int,input().split()))
print('Yes' if sum(A) >= H else 'No')

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

h,a = m()

b = l()

if sum(b) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):

import sys
INF = float("inf")


def yes():
    print("Yes")  


def no():
    print("No")  


def solve(H: int, N: int, A: "List[int]"):
    if H > sum(A):
        no()
    else:
        yes()
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))  
    N = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(N)]  
    solve(H, N, A)


if __name__ == '__main__':
    main()

Solution (Python):
import sys
from collections import defaultdict, deque
import bisect
from heapq import *
from math import factorial, ceil, floor
from collections import defaultdict
import itertools
sys.setrecursionlimit(200000)
input = sys.stdin.readline









H, N, = map(int, input().split())
L = [int(v) for v in input().split()]

if H <= sum(L):
    print("Yes")
else:
    print("No")

Solution (Python):
a , b = map(int,input().split())
l = list(map(int,input().split()))

if a <= sum(l):
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[] for _ in range(num)]
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))



H,N = II()
A = III()

if H-sum(A)<=0:
    print('Yes')
else:
    print('No')

Solution (Python):
N,K = map(int, input().split())
lst = list(map(int, input().split()))
if sum(lst) >= N:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

def main():
    H,N=map(int,input().split())
    A=list(map(int,input().split()))
    print('Yes' if sum(A)>=H else 'No')

if __name__ == '__main__':
    main()

Solution (Python):
h,n = map(int,input().split())
a = list(map(int,input().split()))
if sum(a) >= h:
    print("Yes")
else:
    print("No")

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() 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)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    h,n = LI()
    a = LI()
    if sum(a) >= h:
        print("Yes")
    else:
        print("No")
    return


if __name__ == "__main__":
    solve()

Solution (Python):
h,n=map(int,input().split())
a=list(map(int,input().split()))
if h<=sum(a):print("Yes")
else:print("No")

Solution (Python):
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7


H, N = list(map(int, sys.stdin.buffer.readline().split()))
A = list(map(int, sys.stdin.buffer.readline().split()))

ok =H <= sum(A)
if ok:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    h,n=MI()
    aa=LI()
    if sum(aa)>=h:print("Yes")
    else:print("No")

main()

Solution (Python):


import sys
sys.setrecursionlimit(300000)

YES = "Yes"  
NO = "No"  

def solve(H: int, N: int, A: "List[int]"):
    if sum(A) >= H:
        ret = YES
    else:
        ret = NO
    print(ret)
    return

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))  
    N = int(next(tokens))  
    A = [int(next(tokens)) for _ in range(N)]  
    solve(H, N, A)

if __name__ == '__main__':
    main()

Solution (Python):
h, n = map(int, input().split())
a = list(map(int, input().split()))
if sum(a) < h:
    print('No')
else:
    print('Yes')