TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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`.

Submission attempts (in order):
h,n=map(int,input().split())
a=list(map(int,input().split())
if sum(a)>=h:
       	print('YES')
else:
       print('NO')


h,n=map(int,input().split())
l = [int(input()) for i in range(n)]
  
if sum(l)>=h:
  print('Yes')
else:
  print('No')

h=int(input())
n=int(input())
l = [int(input()) for i in range(n)]
  
if sum(l)>=h:
  print('Yes')
else:
  print('No')

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


h,n=map(int,input().split())
l=[]
for i in range(n):
  l.append(int(input()))
  
if sum(l)>=h:
  print('Yes')
else:
  print('No')

h,n=map(int,input().split())
l=[]
for i in range(n):
  a=int(input())
  l.append(a)
if sum(l)>=h:
  print('Yes')
else:
  print('No')

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H,N=map(int,input().split())
A=[int(input()) for i in range(N)]

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

H,N=map(int,input().split())
A=[input() for i in range(N)]
B=[]
for i in range(N):
  a=int(A[i])
  B.append(a)
if sum(B)>=H:
  print("Yes")
else:
  print("No")

H,N=map(int,input().split())
A=input().split()
B=[]
for i in range(N):
  a=int(A[i])
  B.append(a)
if sum(B)>=H:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H,N = map(int,input().split())
A = list(map(int,input().split()))
if sum(A)>=H:print("yes")
else:print("No")

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

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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`.

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H,_=map(int,input().split())
if H <= list(map(int,input().split())):
    print("Yes")
else:
    print("No")

H, _ = map(int, input().split())
if H <= sum(map(int, input().split())):
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):


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')



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')



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')

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
h, n = map(int, input().split())
a = list(map(int, input().split()))
print(sum(a))
if (sum(a) >= h):
    print('Yes')
else:
    print('No')

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
h,n=map(int,input().split())
a=list(map(int,input().split()))
a.sort(reverse=True)
if a[0]<h:
    print("No")
else:
    print("Yes")


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


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = map(int, input().split())
a = list(map(int, input().split()))

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


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')

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

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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H,N=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
A.reverse()
a=0
for i in range(N):
    a +=A[i]
if a<=0:
    print("Yes")
else:
    print("No")

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
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')

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


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
h,n=map(int,input().split())
if sum(list(map(int,input().split())))<h:
    print('Yes')
else:
    print('No')

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
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')

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')

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = map(int, input().split())
A = list(map(int, input().split()))
print(sum(A))
if sum(A) >= H:
    print("Yes")
else:
    print("No")

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


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = input().split()
lis = list(map(int,input().split())
A =sum(lis)
if H > A:
    print("No")
else:
    print("Yes")

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
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")


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")


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
import math

def resolve():

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

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

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


import sys
from io import StringIO
import unittest

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """10 3
4 5 6"""
        output = """Yes"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """20 3
4 5 6"""
        output = """No"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """210 5
31 41 59 26 53"""
        output = """Yes"""
        self.assertIO(input, output)
    def test_入力例_4(self):
        input = """211 5
31 41 59 26 53"""
        output = """No"""
        self.assertIO(input, output)

if __name__ == "__main__":
    unittest.main()


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

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

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

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

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

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
h, n = input().split(" ")
h = int(h)
n = int(n)
a = [int(input()) for i in range(n) ]
if sum(a) >= h:
  print('Yes')
else:
  print('No')

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
HP,number=map(int,input().split())
a=list(map(int, input().split()))

i=0
attack=0

while True:
  attack=attack+a[i]
  i=i+1
  if i==number:
    break

if attack>=HP:
  print('True')
else:print('失敗！')

HP,number=map(int,input().split())
a=list(map(int, input().split()))

i=0
attack=0

while True:
  attack=attack+a[i]
  i=i+1
  if i==number:
    break

if attack>=HP:
  print('Yes')
else:print('No')

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = map(int, input().split(' '))
sum = 0
for i in range(N):
  damage = int(input())
  sum += damage
  
if sum >= H:
  print('Yes')
else:
  print('No')
  

H, N = map(int, input().split(' '))
numlist = input().split(' ')
count = 0
for num in numlist:
  count += int(num)
  
if count >= H:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
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')

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')

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')

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = map(int, input().split())
A = list(map(int, input().split()))

s=0

for i in range(N):
    s+=A[i]
if(s>=H):
    print(Yes)
else:
    print(No)


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

s=0

for i in range(N):
    s+=A[i]
if(s>=H):
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H,N=input().split()
A=list(map(int,input().split()))
h=int(H)
for i in range(int(N)):
  if h-A[i]>0:
    h-=A[i]
if h>0:
  print("No")
else:
  print("Yes")

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
h, n = map(int, input().split())
n_list = [int(i) for i in input().split()] 

atk = 0
n_list.sort()
for i in range(n):
    h = h - n_list[i]
    if h <= 0:
        print ("yes")
        exit (0)

print ("No")


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

for dmg in n_list:
    h = h - dmg
    if h <= 0:
        print ("Yes")
        exit (0)

print ("No")

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
k,n=map(int,input().split())
a=list(map(int,intput().split()))
if sum(a)>=k:
  print("Yes")
else:
  print("No")

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
h,n=map(int,input().split())
a=list(map(int,input().split())
damage=sum(a)
if damage>=h:
    print("Yes")
else:
    print("No")

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = map(int, input().split())
A = list(map(int, input().split()))

SA = sum(A)
print(H - SA)

if H <= SA:
    print("Yes")

elif H > SA:
    print("No")

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

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

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

SA = sum(A)
print(H - SA)

if H - SA <= 0:
    print("Yes")

elif H - SA > 0:
    print("No")

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

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

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

SA = sum(A)


if H <= SA:
    print("Yes")

elif H > SA:
    print("No")

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
def main():
    H,N=map(int,input().split())

    have=list(map(int,input().split()))
    cal=0

    for i in have:
        cal+=i
        if cal>=H:
            print("YES")
            return

    print("NO")
    return


main()


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

    have=list(map(int,input().split()))
    cal=0

    for i in have:
        cal+=i
        if cal>=H:
            print("YES")
            return

    print("NO")
    return


main()


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

    have=list(map(int,input().split()))
    cal=0

    for i in have:
        cal+=i
        if cal>=H:
            print("Yes")
            return

    print("No")
    return


main()


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = input().split()
A = []
A = input().split()

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

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

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

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

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

H, N = input().split()
A = input().split()

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

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H,N,A = list(map(int, input().split()))
for i in A[N]:
  if H <= 0:
    break
  else:
    H -= A[i]
if set(A):
  print("Yes")
else:
  print("No")

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
,N = map(int,input().split())
Ai = map(int, input().split())
 
if sum(A) >= H:
  print('Yes')
else:
  print('No')

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = input().split()
H = int(H)
N = int(N)

A = input().split()

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

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

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


Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
enemy=int(input())
skill=int(input())
for i in range(skill):
    damage=int(input())
    enemy=enemy-damage
if(enemy<=0):
    print("Yes")
else:
    print("No")


enemy,skill=map(int,input().split())
for i in range(skill):
    damage=int(input())
    enemy=enemy-damage
if(enemy<=0):
    print("Yes")
else:
    print("No")


enemy,skill=map(int,input().split())
damage=map(int,input().split())
if(enemy-sum(damage)<=0):
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
i = 0
while (i < n):
  if(a[i] <= 0):
    print("Yes")
    break
  else:
    i += 1
print("No")

h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
i = 0
while (i < n):
  if(a[i] <= 0):
    print("Yes")
print("No")

h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
answer = "No"
i = 0
while (i < n):
  if(a[i] <= 0):
    answer = "Yes"
    break
  else:
    i += 1
print(answer)

h, n = list(map(int, input().split()))
a = list(map(int, input().split()))
answer = "No"
i = 0
while (i < n):
  h -= a[i]
  if(h <= 0):
    answer = "Yes"
    break
  else:
    i += 1
print(answer)


Verdicts: Wrong Answer

Time Limit Exceeded

Wrong Answer

Accepted
Problem: 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`.

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


import math
n,k=map(int,input().split())
l=list(map(int,input().split()))
if sum(l)>=n:
    print('Yes')
else:
    print('No')


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = input().split()
A = list(int(input().split()))
A = [int(a) for a in A]
if H > sum(A):
    print('No')
else:
    print('Yes')

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H,N = map(int, input().split())
A = list(map(int, input().split()))

sum = 0
ans = None

for a in A:
    sum = sum + a
    if H < a:
        ans = "Yes"
        break
if H > sum and ans == None:
    ans = "No"

print(ans)


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

sum = 0
ans = None

for a in A:
    sum = sum + a
    if H < a:
        ans = "Yes"
        break
if H > sum and ans == None:
    ans = "No"
else:
    ans = "Yes"

print(ans)

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
hp, atk = input().split()

hp = int(hp)
atk = int(atk)

numlist = list((input().split()))

numlist = list(map(int, numlist))

numlist = sorted(numlist, reverse=True)

print(numlist)

for i in range(atk):
    value = 0
    value = value + numlist[i]
    if value > hp:
        print("Yes")
        break
    else:
        print("No")
        break

hp, atk = input().split()

hp = int(hp)
atk = int(atk)

value = 0

numlist = list((input().split()))

numlist = list(map(int, numlist))

numlist = sorted(numlist, reverse=True)

for i in range(atk):
    value = value + numlist[i]
    if value > hp:
        print("Yes")
    else:
        if i+1 == atk:
            print("No")
        else:
            continue

hp, atk = input().split()

hp = int(hp)
atk = int(atk)

numlist = list((input().split()))

numlist = list(map(int, numlist))

numlist = sorted(numlist, reverse=True)

for i in range(atk):
    value = 0
    value = value + numlist[i]
    if value > hp:
        print("Yes")
        break
    else:
        print("No")
        break

import math

hp, atk = input().split()

hp = int(hp)
atk = int(atk)

numlist = list((input().split()))

numlist = list(map(int, numlist))

for i in range(atk):
    value = 0
    value = value + numlist[i]

if value > hp:
    print("Yes")
else:
    print("No")

hp, atk = input().split()

hp = int(hp)
atk = int(atk)

value = 0

numlist = list((input().split()))

numlist = list(map(int, numlist))

print(numlist)

for i in range(atk):
    value = value + numlist[i]

if value > hp:
    print("Yes")
else:
    print("No")

hp, atk = input().split()

hp = int(hp)
atk = int(atk)

value = 0

numlist = list((input().split()))

numlist = list(map(int, numlist))

for i in range(atk):
    value = value + numlist[i]

if value >= hp:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = map(int, input().split())
A = list(map(int, input().split()))

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

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

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

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

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



#a,b = map(int, input().split())
import math
if __name__ == "__main__":

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

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

    

H, N = map(int, input().split())
A = list(map(int, input().split()))
if H <= sum(A):
    print ('Yse')
else:
    print ('No')


#a,b = map(int, input().split())
import math
if __name__ == "__main__":

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

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

    

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
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")

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")

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = input().split(" ")
A = list(map(int, input().split()))
if sum(A) < H:
  print("No")
else:
  print("Yes")

H, N = input().split(" ")
A = input()
if sum(A) < H:
  print("No")
else:
  print("Yes")

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
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")

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")

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

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

counter = 0

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

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

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")

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")

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a,b　=　input().split()
 
print(min(a*int(b),b*(int(a)))

a,b = input().split()
 
print(min(a*int(b),b*int(a) ) )
      


a,b = input().split()
 
print(min(a*int(b),b*int(a) ) )


a,b =　input().split()
 
print(min(a*int(b),b*(int(a) ) )

a,b=map(int,input().split())
s=sum(map(int,input().split()))
print("Yes" ifs>=a else "No")

a,b=map(int,input().split())
s=sum(map(int,input().split()))
print("Yes" if s>=a else "No")

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
h, n = input().split();
h = int(h);
n = int(n);

A = list(map(int, input().split()));

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


h, n = input().split;
h = int(h);
n = int(n);

A = list(map(int, input().split()));

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

h, n = input().split();
h = int(h);
n = int(n);

A = list(map(int, input().split()));

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


Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = map(int, input().split())
A = input().split()

At = 0
for i in range(N):
  At += A[i]
  
if At >= H:
  print('Yes')
else:
  print('No')

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

At = 0
for i in range(N):
  At += int(A[i])
  
if At >= H:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
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')

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')

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')

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')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = input().split()
H = int(H)
N = int(N)
A= input()
total=0
for i in A:
    total += int(i)
if total >= H:
    print("Yes")
elif total < H:
    print("No")

H, N = input().split()
H = int(H)
N = int(N)
A= input().split()
total=0
for i in A:
    total += int(i)
if total >= H:
    print("Yes")
elif total < H:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
import sys
H,N=map(int,input().split())
A=map(int,input().split())
s=0
for i in range(N):
  s+=A[i]
  if s>=H:
    print('Yes')
    sys.exit()
print('No')

H,N=map(int,input().split())
A=list(map(int,input().split()))
s=0
flg=True
for i in range(N):
  s+=A[i]
  if s>=H:
    print('Yes')
    flg=False
    break
if flg:
	print('No')


Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
h, n = map(int, input().split())
a = map(int, input().split())
if sum(a)>=h:
  print("Y")
else:
  print("N")

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
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')

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')

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
    import math

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

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
H, N = map(int, input().split())
A = list(map(int, input().split()))

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

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

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

Verdicts: Runtime Error

Accepted