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



Sample input:
10 3
4 5 6


Sample output:
Yes

Submission status: Wrong Answer

Solution code:
H,N = map(int,input().split())
A = list(map(int,input().split()))
Sum = sum(A)

if Sum > H:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from sys import stdin
import math

h, n = [int(x) for x in stdin.readline().rstrip().split()]
a = [int(x) for x in stdin.readline().rstrip().split()]

sum = 0
for i in a:
    sum += i

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
h, n, *a = map(int, input().split())

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

# S,T = stdin.readline().rstrip().split()
H,N = [int(x) for x in stdin.readline().rstrip().split()]
s = list(map(int,input().split()))

if H>sum(s):
  print("NO")
else :
  print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

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

Submission status: Wrong Answer

Solution code:
h, n = (int(x) for x in input().split())
a = list(int(x) for x in input().split())

txt = 'YES' if(sum(a) >= h) else 'NO'
print(txt)

Submission status: Wrong Answer

Solution code:
def main():
    H,N = list(map(int,input().split()))
    A = list(map(int,input().split()))

    sum_attack = sum(A)

    if(H < sum_attack):
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

def main():
    input = stdin.readline

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

    print(A)

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
h,n=map(int,input().split())
a = list(map(int,input().split()))
for i in range(n):
  h -= a[i]
if h>0 :
  print("n↨o")
else:
  print("y↨es")

Submission status: Wrong Answer

Solution code:
H,N=map(int,input().split())
A=map(int,input().split())
B=sum(A)
ans='YES'
if B<H:
  ans='NO'
print(ans)

Submission status: Wrong Answer

Solution code:
H,N =map(int, input().split())
A = list(map(int, input().split()))
for Ax in A:
  H -= Ax
if H < 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
h, n = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse=True)
attack = sum(A[:2])
print("Yes") if h <= attack else print("No")

Submission status: Wrong Answer

Solution code:
kazu1 = list(map(int, input().split()))
kazu2 = list(map(int, input().split()))

if kazu1[0] <= sum(kazu2):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import math

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

a_sum = sum(a)

if h <= a_sum:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
L1 = input().split()
L2 = input().split()
H, N = int(L1[0]), int(L1[1])

d = 0
for i in L2:
    d += int(i)

if d < H:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

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

SUM_A = sum(A)

if SUM_A < H :
    print("NO")
else :
    print("YES")

Submission status: Wrong Answer

Solution code:
#L, R = map(int,input().split())
H,N = map(int,input().split())
A = list(map(int,input().split()))

a = 0
for i in A:
  a += i
  
if a>H:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
h,n=map(int,input().split())
l=list(map(int,input().split()))
l=sorted(l)
a=l[-2:]
if sum(a)>=h:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
h,n=map(int,input().split())
l=list(map(int,input().split()))
l=sorted(l)
a=l[-2:]
if sum(a)>=h:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k = map(int,input().split())
hs = list(map(int,input().split()))

hs.sort()

print(sum(hs[:len(hs)-k]))

Submission status: Wrong Answer

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

if H <= A:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

if sum(A) >= H:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
H,N = map(int,input().split())
total_attack_damage = sum(list(map(int,input().split())))

result = H = total_attack_damage

if result <= 0:
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

Solution code:
H,N = map(int,input().split())
total_attack_damage = sum(list(map(int,input().split())))

result = H - total_attack_damage
if result > 0:
	print("NO")
elif result <= 0:
	print("YES")

Submission status: Wrong Answer

Solution code:
H,N = map(int,input().split())
total_attack_damage = sum(list(map(int,input().split())))

if H <= total_attack_damage:
	print('YES')
else:
	print('NO')

Submission status: Wrong Answer

Solution code:

inputa = input()

h,n = inputa.split()
H=int(h)
N=int(n)
inputb=input()
Attacks=inputb.split()
Attacks.sort(reverse=True)
print(Attacks)
cnt=0
maxlen=len(Attacks)
for i in range(N):
  H=H-int(Attacks[maxlen-i-1])
  cnt=cnt+1

if(H >0):
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
H, N = list(map(int, input().split(' ')))
# A_list = list(map(int, input().split(' ')))
A_list = [int(x) for x in input().split()]
sum_atack = sum(A_list)
if sum_atack >= H:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
H, N = list(map(int, input().split(' ')))
A_list = list(map(int, input().split(' ')))
sum_atack = sum(A_list)
if sum_atack >= H:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
h, n = map(int, input().split())
a = list(map(int, input().split()))
hp = 0

for i in range(n):
    h -= a[i]
    
if h < 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
inp1 =input().split(" ")
HP,N= int(inp1[0]),int(inp1[1])

inp2 = input().split(" ")

ATK = 0
for x in range(N):
  ATK += int(inp2[x])
  
if HP <= ATK:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

if n > sum(a):
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
H,N=map(int,input().split())
As=[int(i) for i in input().split()]
if sum(As)>H:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np

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

if np.sum(np.array(A)) >= H:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
H,N=map(int,input().split())
A=list(map(int,input().split()))
Max_A=0
for i in range(len(A)):
  Max_A=Max_A+A[i]
if Max_A>=H:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
H,N=map(int,input().split())
print('NYoe s'[H<sum(list(map(int,input().split())))::2])

Submission status: Wrong Answer

Solution code:
hp,kind = input().split(" ")
sp_atk = [int(i) for i in input().split()]

if int(hp) < sum(sp_atk):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
hp,kind = input().split(" ")
sp_atk = [int(i) for i in input().split()]

for atk in sp_atk:
  hp = int(hp) - atk
  
if hp < 0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
h,n=map(int,input().split())
List=list(map(int,input().split()))
# print(h)
# print(n)
# print(List)
if sum(List)>= h:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

SUM = sum(A)
if H > SUM:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
enemy, num = map(int,input().split())
skills = list(map(int,input().split()))
print("Yes") if sum(skills) < enemy else print("No")

Submission status: Wrong Answer

Solution code:
num = input()
list = list(map(int,input().split()))
list2 = set(list) 
print("No") if len(list) == len(list2) else print("Yes")

Submission status: Wrong Answer

Solution code:
h,n = map(int,input().split())
i = list(map(int,input().split()))
ans = 0
for j in range(n):
    ans+=i[j]
    if ans > h:
        print("Yes")
        exit()
print("No")

Submission status: Wrong Answer

Solution code:
H, N = map(int, input().split())
Atack = list(map(int, input().split()))

total = 0
for i in range(N):
  total += Atack[i-1]
  if total >= H:
    print('Yes')
    
if total < H:
  print('No')

Submission status: Wrong Answer

Solution code:
H, N = map(int, input().split())
a = list(map(int, input().split()))

if H > sum(a):
  print('NO')
else:
  print('YES')

Submission status: Wrong Answer

Solution code:
H, N = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse=True)

if H > sum(a[:N]):
  print('NO')
else:
  print('YES')

Submission status: Wrong Answer

Solution code:
import math
query=[int(x) for x in input().split()]
N = query[0]
K = query[1]
l=[int(x) for x in input().split()]
SUM=sum(l)
if N-SUM<=0:
    print("YES")
else:
   print("NO")

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
s=list(map(int,input().split()))
if a<=sum(s):
    print ("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
s=list(map(int,input().split()))
count=0
for i in range(b):
    if count==0:
        for j in range(i,b):
            if a<s[i]+s[j] and count==0:
                print("yes")
                count+=1
if count==0:
    print("no")

Submission status: Wrong Answer

Solution code:
print('No' if int(input().split()[0])<sum(list(map(int, input().split()))) else 'Yes')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if H <= sum(A):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
H, N = map(int,input().split())
Ai = list(map(int,input().split()))
Ai_sum = sum(Ai)
if Ai_sum >= H:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
def attack(h, n, arr):
    print(sum(arr))
    h -= sum(arr)
    if h <= 0:
        return 'Yes'
    else:
        return 'No'

if __name__ == "__main__":
    h, n = map(int, input().split())
    arr = list(map(int,input().split()))
    print(attack(h, n, arr))

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(int(1e6))
 
H, N = list(map(int, input().split()))
A = list(map(int, input().split()))
 
if H <= sum(A):
    print('Yes')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(int(1e6))

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

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

Submission status: Wrong Answer

Solution code:
h,n = map(int,raw_input().strip().split())
a = map(int,raw_input().strip().split())
summ = sum(a)
if summ-h>=0:
	print "YES"
else:
	print "NO"

Submission status: Wrong Answer

Solution code:
H, N = map(int, input().split())
a = list(map(int, input().split()))

print(sum(a))

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

Submission status: Wrong Answer

Solution code:
H, N = map(int, input().split())
a = list(map(int, input().split()))

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

Submission status: Wrong Answer

Solution code:
HN=input()
HN_list=HN.split()
H=int(HN_list[0])
N=int(HN_list[1])
A=input()
A_list=A.split()
aaa=map(int, A_list)
A_sum=sum(aaa)
if A_sum>H:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

if H <= sum(A[:2]):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
h, n = [int(i) for i in input().split()]
a = [int(j) for j in input().split()]

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

Submission status: Wrong Answer

Solution code:
h,n = map(int,input().split())
alist = list(map(int,input().split()))
while n >0:
    n -= 1
    h = h-alist[n]
if h <=0:
    print('YES') 
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
h,n = map(int,input().split())
alist = list(map(int,input().split()))

while n >0:
    n -= 1
    h = h-alist[n]
if h <=0:
    print('YES') 
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
h,n = map(int,input().split())
alist = list(map(int,input().split()))
while n >=0:
    n -= 1
    h = h-alist[n]
if h <=0:
    print('YES') 
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
#AtCorder Common Raccoon vs Monster

def main():
	H,N=map(int, input().split())
	A = [int(_) for _ in input().split()]
	if sum(A)>=H:
		print('YES')
	else:
		print('NO')
main()

Submission status: Wrong Answer

Solution code:
h, n = map(int, input().split())
a = list(map(int, input().split()))
 
sum = 0
for i in range(n):
  sum += a[i]
 
if h <= sum:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
from sys import stdin

 
H,N,*A = map(int,stdin.readline().rstrip().split())
 
answer = 'Yes' if sum(A) >= H else 'No'
print(answer)

Submission status: Wrong Answer

Solution code:
H,N=map(int,input().split())
A=list(map(int,input().split()))
A.sort(reverse=True)
  
total=H-sum(A[0:2])
if total<=0:print("Yes")
else:print("No")

Submission status: Wrong Answer

Solution code:
hp , n = map(int, input().split())
na = map(int, input().split())

attack = 0
for i in na :
    attack = attack + i

if(hp <= attack):
    ans = 'YES'
else:
    ans = 'NO'

print(ans)

Submission status: Wrong Answer

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

if H < sum(A):
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
H,N = map(int,input().split())
A = list(map(int,input().split()))
print(H < sum(A))

Submission status: Wrong Answer

Solution code:
"""
author : halo2halo
date : 4, Feb, 2020
"""

import sys

# import itertools
# import math

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

H, N,*A = map(int, read().split())
print('YES' if H<=sum(A) else 'No')

Submission status: Wrong Answer

Solution code:
"""
author : halo2halo
date : 4, Feb, 2020
"""

import sys

# import itertools
# import math

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

H, N,*A = map(int, readline().split())
print('YES' if H<=sum(A) else 'No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
H,N = map(int,input().split())
A = list(map(int,input().split()))
if np.sum(A)>=H:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
H,N = list(map(int,input().split()))
alist = list(map(int,input().split()))
if H < sum(alist):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# B - Common Raccoon vs Monster
def main():
  s = list(map(int,input().split()))
  hp = s[0]
  ad = s[1]
  ans = int(hp / ad)
  if(ans * ad < hp):ans = ans + ad
  print(ans)
if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
# B - Common Raccoon vs Monster
def main():
  s = list(map(int,input().split()))
  hp = s[0]
  ad = s[1]
  ans = int(hp / ad)
  if(ans * ad < hp):ans = ans + 1
  print(ans)
if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
a,b=input().split()
l = list(map(int, input().split()))
a=int(a)
b=int(b)
if a >= sum(l):
  print('Yes')

else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
input_val = input().split()
H=int(input_val[0])
A=int(input_val[1])

if H%A==0:
  print(H/A)
else:
  print(H/A+1)

Submission status: Wrong Answer

Solution code:
S_hn = input().split(" ") #標準入力（H, N）
S_a = input().split(" ") #標準入力（必殺技）

H = int(S_hn[0]) #モンスターのHP
N = int(S_hn[1]) #技の種類
A = [] #必殺技
for i in range(N):
  A.append(int(S_a[i]))
  
if H < sum(A):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
S_hn = input().split(" ") #標準入力（H, N）
S_a = input().split(" ") #標準入力（必殺技）

H = int(S_hn[0]) #モンスターのHP
N = int(S_hn[1]) #技の種類
A = [] #必殺技
for i in range(N):
  A.append(int(S_a[i]))
  
if H < sum(A):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
H,N = map(int,input().split(" "))
A = list(map(int,input().split(" ")))
flag = False
for i in range(N):
    H = H - A[i]
    if H <= 0:
        print("YES")
        flag = True
        break
if flag == False:
    print("NO")

Submission status: Wrong Answer

Solution code:
N,K = [int(x) for x in input().split()]
n=[int(x) for x in input().split()]
print("Yes" if sum(n)>N else "No")

Submission status: Wrong Answer

Solution code:
import itertools

H,N = map(int,input().split())
A = list(map(int,input().split()))
l = list(itertools.permutations(A,3))

ans = []
for i in l:
    if sum(i) >= H:
        ans.append("Yes")
    else:
        ans.append("No")

if "Yes" in ans:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import itertools

H,N = map(int,input().split())
A = list(map(int,input().split()))
l = list(itertools.permutations(A,2))

ans = []
for i in l:
    if sum(i) >= H:
        ans.append("Yes")
    else:
        ans.append("No")

if "Yes" in ans:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
H, N = map(int, input().split())
A = map(int, input().split())
sum = 0

for val in A:
	sum = sum + val

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

Submission status: Wrong Answer

Solution code:
import math

h, n = map(int, input().split())
a = [int(i) for i in input().split()]

if sum(a) >= h:
  print('yes')
else:
  print('no')

Submission status: Wrong Answer

Solution code:
import math
h, n = map(int, input().split())
attack_list = list(map(int, input().split()))
damage = 0
for attack in attack_list:
  damage += attack
  if damage > h:
    print('Yes')
    exit()
print('No')

Submission status: Wrong Answer

Solution code:
import math
h, n = map(int, input().split())
attack_list = list(map(int, input().split()))
damage = 0
for attack in attack_list:
  damage += attack
  if damage >= h:
    print('Yes')
print('No')

Submission status: Wrong Answer

Solution code:
import math
h, n = map(int, input().split())
attack_list = list(map(int, input().split()))
damage = 0
for attack in attack_list:
  damage += attack
  if damage > h:
    print('Yes')
print('No')

Submission status: Wrong Answer

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

damage = 0

for i in range(1,n):
    damage += a[i]
if damage < h:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
X = list(map(int, input().split()))
H = X[0]
A = X[2:]
if sum(A)>=H:
    print('Yes')
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a, b = map(float, input().split())
attack_list = list(map(float, input().split()))


print(sum(attack_list))


if(a <= sum(attack_list)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
h,n=map(int,input().split())
a=list(map(int,input().split()))
x=0
for i in range(n):
  x+=a[i]
print(x)

Submission status: Wrong Answer

Solution code:
h, n = map(int, input().split())
a = map(int, input().split())
if sum(a)>=h:
  print("Y")
else:
  print("N")

Submission status: Wrong Answer

Solution code:
h, n = (int(x) for x in input().split())
a = (int(x) for x in input().split())
if h < sum(a):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import math
import string
import itertools
import fractions
import heapq
import collections
import re
import array
import bisect
import sys
import random
import time
inf = 10**9


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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
H, N = map(int,(input().split()))
A = list(map(int,(input().split())))
sum=0
for i in range(len(A)):
  sum += A[i]
if(sum>=N):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
line=input()
data=input()
line=line.split()
data=data.split()
num=int(line[0])
print(num)
for i in range(int(line[1])):
    num-=int(data[i])
if num>0:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
h, n = map(int, input().split())
a = input().split()
b = 0
def has_duplicates(seq):
    return len(seq) != len(set(seq))

for i in range(n):
    b += int(a[i])
if (h > b or has_duplicates(a) or len(a) > n ):
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
h, n = map(int, input().split())
a = input().split()
b = 0
def has_duplicates(seq):
    return len(seq) != len(set(seq))

for i in range(n):
    b += int(a[i])
if (h < b or has_duplicates(a) or len(a) > n ):
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
h, n = map(int, input().split())
a = input().split()
print(a)
b = 0
for i in range(n):
    b += int(a[i])
if (h > b):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math
n,k=map(int,input().split())
l=list(map(int,input().split()))
if sum(l)>=n:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
H,N = map(int,input().split())
A = list(map(int,input().split()))
sum=0
for a in A:
    sum += a
print("Yes") if sum> H else print("No")

Submission status: Wrong Answer

Solution code:
H, N = list(map(int, input().split()))
tec = list(map(int, input().split()))

print("Yes" if sum(tec) > H else "No")

Submission status: Wrong Answer

Solution code:
h, n = map(int, input().split())
a_list = list(map(int, input().split()))

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

Submission status: Wrong Answer

Solution code:
hp, n = map(int, input().split())
a = map(int, input().split())
print("YES" if sum(a) >= hp else "NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
h,n=map(int,input().split())
print('YNeos'[sum([int(i)for i in input().split()])<n::2])

Submission status: Wrong Answer

Solution code:
h,n=map(int,input().split())
'YNeos'[sum([int(i)for i in input().split()])<n::2]

Submission status: Wrong Answer

Solution code:
l1 = input().strip().split()
h = int(l1[0])
n = int(l1[1])
a = sorted([int(i) for i in input().strip().split()], reverse=True)
if h < sum(a[:2]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
l1 = input().strip().split()
h = int(l1[0])
n = int(l1[1])
a = sorted([int(i) for i in input().strip().split()], reverse=True)
if h < sum(a[:n-1]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
l1 = input().strip().split()
h = int(l1[0])
n = int(l1[1])
a = sorted([int(i) for i in input().strip().split()], reverse=True)
print(a)
if h < sum(a[:n]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
H, N = map(int, input().split())
lst = [int(x) for x in input().split()]
if N >= sum(lst):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
H, N = map(int,input().split())
A_list = list(map(int, input().split()))

judge = 'Yes' if sum(A_list)>H else 'No'

print(judge)

Submission status: Wrong Answer

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

if(h <= sum(a)):
  ans = "YES"
else:
  ans = "NO"
print(ans)

Submission status: Wrong Answer

Solution code:
a = input().split()
h, n = int(a[0]), int(a[1])
nums = input().split()
nums = list(map(int, nums))
x = sum(nums)
if x >= h:
  print("yes")
else:
  print("no")

Submission status: Wrong Answer

Solution code:
a = input().split()
h, n = int(a[0]), int(a[1])
nums = input().split()
nums = list(map(int, nums))
x = sum(nums)

if x >= h:
  print("yes")
else:
  print("no")

Submission status: Wrong Answer

Solution code:
S = list(map(int, input().split()))
A = list(map(int, input().split()))
H , N = S[0], S[1]
for i in A:
    N -= i
if H <= 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
S = list(map(int, input().split()))
A = list(map(int, input().split()))
H , N = S[0], S[1]
for i in A:
    N -= i
if N <= 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys

def main():

    # sys.stdin = open('input153b.txt')

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

    if h > sum(a):
        print('NO')
    else:
        print('YES')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
H, A = map(int, input().split())

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


while H > 0:
  for i in sa:
    H = H - i

  if H > 0:
    break

if H <= 0:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
H, A = map(int, input().split())

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

for i in sa:
  H = H - i

if H <= 0:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
H, A = map(int, input().split())

sa = list(map(int, input().split()))
print(sa)

counter = 0

while H > 0:
  for i in sa:
    H = H - i
    counter += 1

if counter >= len(sa):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
l=list(map(int,input().split()))
if max(l)>=a:
	print('Yes')
else:
	print("No")

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
print(sum(map(int,input().split())))

Submission status: Wrong Answer

Solution code:
h, n = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse=True)
if sum(A[:n]) >= h:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y=map(int,input().split())
s=sum(list(map(int,input().split())))
if x<s:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
h, n = map(int, input().split())
A = list(map(int, input().split()))

sum_a = sum(A)
if h - sum_a < 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

"""
name: 153B.py
プログラムの説明
"""

def main():
    H,N = map(int, input().split())
    A = input().split()

    TotalA = 0
    for i in A:
        TotalA += int(i)
    
    if H<TotalA:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()