problem_id stringlengths 6 6 | user_id stringlengths 10 10 | time_limit float64 1k 8k | memory_limit float64 262k 1.05M | problem_description stringlengths 48 1.55k | codes stringlengths 35 98.9k | status stringlengths 28 1.7k | submission_ids stringlengths 28 1.41k | memories stringlengths 13 808 | cpu_times stringlengths 11 610 | code_sizes stringlengths 7 505 |
|---|---|---|---|---|---|---|---|---|---|---|
p02784 | u698919163 | 2,000 | 1,048,576 | 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`. | ['H,N = list(map(int,input().split()))\nA = list(map(int,input().split()))\n\nif H <= sum(A):\n print("YES")\nelse:\n print("NO")', 'H,N = list(map(int,input().split()))\nA = list(map(int,input().split()))\n\nif H <= sum(A):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s385055973', 's191905047'] | [13964.0, 13964.0] | [41.0, 41.0] | [127, 127] |
p02784 | u706330549 | 2,000 | 1,048,576 | 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`. | ['h, n = [int(x) for x in input().split()]\n\na_n = list(map(int, input().split()))\n\nif sum(a_n) >= h:\n print("yes")\nelse:\n print("No")', 'h, n = [int(x) for x in input().split()]\n\na_n = list(map(int, input().split()))\n\nif sum(a_n) >= h:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s765923202', 's150102671'] | [13964.0, 13964.0] | [40.0, 41.0] | [137, 138] |
p02784 | u708890186 | 2,000 | 1,048,576 | 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`. | ["N,K=map(int,input().split())\nA=[int(i) for i in input().split()]\nv=A.sum()\nif v>=N:\n print('Yes')\nelse:\n print('No')", "N,K=map(int,input().split())\nA=[int(i) for i in input().split()]\nv=0\nfor i in range(K):\n v+=A[i]\nif v>=N:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s189989269', 's503322291'] | [13836.0, 13788.0] | [44.0, 58.0] | [118, 141] |
p02784 | u715005228 | 2,000 | 1,048,576 | 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`. | ['h, n = map(int, input().split())\na = list(map(int,input().split()))\n\nif h > sum(a):\n print("NO")\nelse:\n print("YES")\n ', 'h, n = map(int, input().split())\na = list(map(int,input().split()))\n\nif h > sum(a):\n print("No")\nelse:\n print("Yes")\n '] | ['Wrong Answer', 'Accepted'] | ['s122695690', 's267995556'] | [13964.0, 13964.0] | [41.0, 41.0] | [127, 127] |
p02784 | u719193574 | 2,000 | 1,048,576 | 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`. | ["H,N=map(int,input().split())\nA=list(map(int,input().split()))\nif H<=sum(a):\n print('Yes')\nelse:\n print('No')", "H,N=map(int,input().split())\nA=list(map(int,input().split()))\nif H<=sum(A):\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s665435200', 's171329968'] | [13964.0, 13964.0] | [40.0, 41.0] | [110, 110] |
p02784 | u723612973 | 2,000 | 1,048,576 | 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`. | ['h,n=map(int,input().split())\na=list(map(int,input().split()))\ns=0\nf=0\nfor i in range(n):\n if(s>=h):\n f=1\n break\n s=s+a[i]\nif(f==1):\n print("Yes")\nelse:\n print("No")', 'h,n=map(int,input().split())\na=list(map(int,input().split()))\ns=0\nf=0\nfor i in range(n):\n s=s+a[i]\n if(s>=h):\n f=1\n break\nif(f==1):\n print("YES")\nelse:\n print("NO")', 'h,n=map(int,input().split())\na=list(map(int,input().split()))\ns=0\nf=0\nfor i in range(n):\n s=s+a[i]\n if(s>=h):\n f=1\n break\nif(f==1):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s040892188', 's908858370', 's794541830'] | [14016.0, 13964.0, 13964.0] | [62.0, 57.0, 58.0] | [190, 190, 190] |
p02784 | u727717182 | 2,000 | 1,048,576 | 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`. | ['from sys import stdin\n\ndef main():\n input = stdin.readline\n\n H,N = map(int,input().split())\n A = list(map(int,input().split()))\n\n print(A)\n\n if (H <= sum(A)):\n print("Yes")\n else:\n print("No")\n\nif __name__ == "__main__":\n main()', 'from sys import stdin\n\ndef main():\n input = stdin.readline\n\n H,N = map(int,input().split())\n A = list(map(int,input().split()))\n\n if (H <= sum(A)):\n print("Yes")\n else:\n print("No")\n\nif __name__ == "__main__":\n main()'] | ['Wrong Answer', 'Accepted'] | ['s908799949', 's176797520'] | [13860.0, 14040.0] | [49.0, 42.0] | [263, 249] |
p02784 | u729911693 | 2,000 | 1,048,576 | 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`. | ["A = []\nH, N = map(int, input().split())\nA = list(map(int, input().split()))\nif(H >= sum(A)):\n print('Yes')\nelse:\n print('No')", "A = []\nH, N = map(int, input().split())\nA = list(map(int, input().split()))\nif(H <= sum(A)):\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s623581572', 's184667037'] | [14092.0, 13964.0] | [43.0, 41.0] | [127, 127] |
p02784 | u731362892 | 2,000 | 1,048,576 | 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`. | ['h,n=map(int,input().split())\natt=list(map()int,input().split())\nif sum(att)>=h:\n print("Yes")\nelse:\n print("No")', 'h,n=map(int,input().split())\natt=list(map(int,input().split()))\nif sum(att)>=h:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s374449334', 's977721317'] | [2940.0, 13964.0] | [17.0, 42.0] | [114, 114] |
p02784 | u733837151 | 2,000 | 1,048,576 | 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`. | ["\nH, N = map(int, input().split())\ndamege = map(int, input().split())\ndamege_list = [damege]\n\ndamege.sort()\n\nif H - (damege[-1] + damege[-2]) <= 0:\n print('Yes')\nelse:\n print('No')", "H, N = map(int, input().split())\ndamege = map(int, input().split())\n\ndamege.sort()\n\nif H - (damege[-1] + damege[-2]) <= 0:\n print('Yes')\nelse:\n print('No')", "\n\n\n\n\n\n\nH, N = map(int, input().split())\ndamege = map(int, input().split())\n\ntotal_damege = sum(damege)\n\nif H - total_damege <= 0:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s395588686', 's580539700', 's370223953'] | [16508.0, 16428.0, 17276.0] | [34.0, 31.0, 44.0] | [185, 161, 786] |
p02784 | u740047492 | 2,000 | 1,048,576 | 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`. | ['h,n=map(int,inpiut().split())\na=[int(i) for i in input().split()]\n\nif sum(a)>h:\n print("Yes")\nelse:\n print("No")', 'h,n=map(int,input().split())\na=[int(i) for i in input().split()]\n\nif sum(a)>=h:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s418369046', 's045482157'] | [2940.0, 13964.0] | [17.0, 43.0] | [118, 118] |
p02784 | u741397536 | 2,000 | 1,048,576 | 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`. | ['import sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10 ** 7)\n\nH, A = map(int, input().split())\n\nprint(-(-H//A))', 'import sys\ninput = sys.stdin.readline\nsys.setrecursionlimit(10 ** 7)\n\nH, N = map(int, input().split())\nA = list(map(int, input().split()))\n\n\nA = sorted(A, reverse=True)\n\nif sum(A[:N]) >= H:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s093944329', 's765699221'] | [3060.0, 13876.0] | [17.0, 77.0] | [119, 228] |
p02784 | u742551329 | 2,000 | 1,048,576 | 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`. | ['import numpy as np\n\nH, N = [int(i) for i in input().split()]\nA = [int(a) for a in input().split()]\n\nif np.sum(np.array(A)) >= H:\n print("YES")\nelse:\n print("NO")\n', 'import numpy as np\n\nH, N = [int(i) for i in input().split()]\nA = [int(a) for a in input().split()]\n\nif np.sum(np.array(A)) >= H:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s328646249', 's137881636'] | [22932.0, 22932.0] | [194.0, 183.0] | [168, 168] |
p02784 | u750120744 | 2,000 | 1,048,576 | 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`. | ["import math\n\nA = []\nsum = 0\nH,N = (int(x) for x in input().split())\n\nfor i in range(N):\n A.append(int(input()))\n sum += A[i]\n\nif(sum >= H):\n print('Yes')\nelse:\n print('No')", "H,N = map(int, input().split())\nA = list(map(int, input().split()))\n\nif sum(A)>=H:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s022399871', 's174544980'] | [4468.0, 13964.0] | [21.0, 41.0] | [184, 121] |
p02784 | u756399469 | 2,000 | 1,048,576 | 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`. | ['H,N=map(int,input().split())\nA=[map(int,input().split())]\na=sum(A)\nif H<=a:\n print("Yes")\nelse:\n print("No")', 'H,N=map(int,input().split())\nA=list(map(int,input().split()))\na=sum(A)\nif H<=a:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s524684973', 's539961727'] | [10712.0, 13964.0] | [26.0, 43.0] | [110, 115] |
p02784 | u757274384 | 2,000 | 1,048,576 | 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`. | ['h,n = map(int, input().split())\nA = list(map(int, input().split()))\n\nif H <= sum(A):\n print("Yes")\nelse:\n print("No")', 'h,n = map(int, input().split())\nA = list(map(int, input().split()))\n\nif h <= sum(A):\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s734190301', 's997794731'] | [13964.0, 14092.0] | [41.0, 41.0] | [119, 120] |
p02784 | u762488523 | 2,000 | 1,048,576 | 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`. | ["h, n = map(int, input().split() ) \nl = []\nfor i in range(n):\n l.append(input()) \n\na = sum(l)\n\nif h > a:\n print('No')\nelse:\n print('Yes')", "h, n = map(int, input().split() ) \nl = []\nfor i in range(n):\n l.append(input()) \n\na = sum(l)\n\nif h >= a:\n print('Yes')\nelse:\n print('No')", "h, n = map(int, input().split() ) \nl = list(map(int, input().split())) \n\na = sum(l)\n\nif h > a:\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s186252589', 's737013205', 's741739628'] | [4260.0, 4260.0, 13964.0] | [18.0, 18.0, 41.0] | [205, 206, 194] |
p02784 | u763963344 | 2,000 | 1,048,576 | 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`. | ["H,N=map(int,input().split())\nA=map(int,input().split())\n\nif H<=sum(A):\n print('YES')\nelse:\n print('NO')", "H, N = map(int, input().split())\nA = list(map(int, input().split()))\n\n\ndef answer(H: int, N: int, A: list) -> str:\n damage = 0 \n for i in range(0, N): \n damage += int(A[i]) \n \n i += 1 \n if damage < H:\n return 'No'\n else:\n return 'Yes'\n\nprint(answer(H, N, A))"] | ['Wrong Answer', 'Accepted'] | ['s086237221', 's560899519'] | [16444.0, 20600.0] | [47.0, 60.0] | [109, 413] |
p02784 | u773246942 | 2,000 | 1,048,576 | 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`. | ['H, N = map(int, input().split())\nA = list(map(int, input().split()))\n\nSUM_A = sum(A)\n\nif SUM_A < H :\n print("NO")\nelse :\n print("YES")', 'H, N = map(int, input().split())\nA = list(map(int, input().split()))\n\nSUM_A = sum(A)\n\nif SUM_A < H :\n print("No")\nelse :\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s786054363', 's599500218'] | [13964.0, 14016.0] | [40.0, 41.0] | [140, 140] |
p02784 | u779830746 | 2,000 | 1,048,576 | 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`. | ["\nmonster_hp = int(input())\nquantity_of_skills = int(input())\nskills = map(int, input().split())\nskills_list = [skills]\n\n\ntotal_damage = 0\nfor i in skills_list:\n total_damage += i\n\nif monster_hp <= total_damage:\n print('Yes')\nelse:\n print('No')", "\nmonster_hp, quantity_of_skills = map(int, input().split())\nskills = map(int, input().split())\nskills_list = [skills]\n\n\ntotal_damage = 0\nfor i in skills_list:\n total_damage += i\n\nif monster_hp <= total_damage:\n print('Yes')\nelse:\n print('No')", "\nmonster_hp, quantity_of_skills = map(int, input().split())\nskills = map(int, input().split())\nskills_list = list(skills)\n\n\ntotal_damages = 0\nfor i in skills_list:\n total_damages += i\n\nif monster_hp <= total_damages:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s352973968', 's614823526', 's115216973'] | [9180.0, 16388.0, 20584.0] | [24.0, 34.0, 58.0] | [268, 267, 274] |
p02784 | u780475861 | 2,000 | 1,048,576 | 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`. | ["import sys\nread = sys.stdin.read\n\nh,n,*lst=map(int, read().split())\ns=sum(lst)\nif s<=h:\n print('Yes')\nelse:\n print('No')", "import sys\nread = sys.stdin.read\n\nh,n,*lst=map(int, read().split())\ns=sum(lst)\nif s>=h:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s655663245', 's867711908'] | [13916.0, 13916.0] | [41.0, 41.0] | [122, 122] |
p02784 | u780698286 | 2,000 | 1,048,576 | 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`. | ['h, n = map(int, input().split())\na = [int(input()) for i in range(n)]\nif sum(a) >= h:\n print("Yes")\nelse:\n print("No")', 'h, n = map(int, input().split())\na = list(map(int, input().split()))\nif h <= sum(a):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s410693969', 's068065812'] | [10076.0, 20532.0] | [29.0, 53.0] | [120, 119] |
p02784 | u789896699 | 2,000 | 1,048,576 | 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`. | ['input_num=input()\nn=input_num.split()\nnum = list(map(int,n))\n\nN=sum(num[2:])\n\nif num[0]<=N:\n print("Yes")\nelse:\n print("No")', 'input_num=[input() for i in range(2)]\n\nn=input_num[0].split()\nn=list(map(int,n))\na=input_num[1].split()\na=list(map(int,a))\n\nN=sum(a)\n\nif n[0]<=N:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s394980902', 's688253255'] | [3060.0, 14552.0] | [17.0, 41.0] | [126, 180] |
p02784 | u796842765 | 2,000 | 1,048,576 | 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`. | ['H, N = map(int, input().split())\nA = list(map(int, input().split()))\nMAX = sum(A)\n\nif MAX < H:\n print("No)\nelse:\n print("Yes")', 'H, N = map(int, input().split())\nA = list(map(int, input().split()))\nB = sum(A)\nif B >= H:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s306340155', 's618840934'] | [3064.0, 13964.0] | [17.0, 41.0] | [128, 129] |
p02784 | u813125722 | 2,000 | 1,048,576 | 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`. | ['x = input().split()\nA = input().split()\nH = int(x[0])\nN = int(x[1])\na = 0\nfor i in range(N):\n a+=(A[i])\nif a>=H:\n print("Yes")\nelse:\n print("No")', 'HN = input().split()\nA = input().split()\nH = int(HN[0])\nN = int(HN[1])\nsum = 0\nfor i in range(N):\n sum += int(A[i])\nif sum >= H:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s298612644', 's605020943'] | [10584.0, 10552.0] | [25.0, 56.0] | [154, 171] |
p02784 | u814265211 | 2,000 | 1,048,576 | 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`. | ['C:\\Users\\Y\\PycharmProjects\\testProject\\venv\\Scripts\\python.exe C:/Users/Y/PycharmProjects/testProject/main.py\n210 5\n31 41 59 26 53\nYes\n\nProcess finished with exit code 0\n', 'h, n = map(int, input().split())\na = map(int, input().split())\n\nprint("Yes" if sum(a) >= h else "No")'] | ['Runtime Error', 'Accepted'] | ['s943081204', 's174084791'] | [2940.0, 9944.0] | [17.0, 37.0] | [170, 101] |
p02784 | u819593641 | 2,000 | 1,048,576 | 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`. | ["H,N = map(int, input().split())\nA = list(map(input().split()))\nif sum(A) >= H:\n print('Yes')\nelse:\n print('No')", "H,N = map(int, input().split())\nA = list(map(int, input().split()))\nif sum(A) >= H:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s151714098', 's698192750'] | [10552.0, 13964.0] | [25.0, 41.0] | [113, 119] |
p02784 | u821135866 | 2,000 | 1,048,576 | 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`. | ['H,N=map(int, input().split())\narr = list(map(int, input().split()))\nif H<=sum(arr):\n print("YES")\nelse:\n print("NO")\n', 'H,N = map(int, input().split())\narr = sorted(list(map(int, input().split())))\nct=sm=0\nwhile sm<H:\n for i in range(N):\n sm+=arr[i]\n ct+=1\nif ct<=N:\n print("YES")\nelse:\n print("NO")\n \n \n', 'H,N = map(int, input().split())\narr = sorted(list(map(int, input().split())))\nif sum(arr)<H:\n print("NO")\nelse:\n print("YES")\n \n \n', 'H,N=map(int, input().split())\narr = list(map(int, input().split()))\nif H<=sum(arr):\n print("YES")\nelse:\n print("NO")\n', 'H,N=map(int, input().split())\narr = list(map(int, input().split()))\nif H<=sum(arr):\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s547950595', 's670818034', 's755971963', 's943501265', 's707888749'] | [13964.0, 13964.0, 13964.0, 13964.0, 13964.0] | [43.0, 116.0, 75.0, 44.0, 40.0] | [123, 217, 146, 123, 123] |
p02784 | u824734140 | 2,000 | 1,048,576 | 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`. | ['h, n, *a = map(int, input().split())\n\nif sum(a) >= h:\n print("Yes")\nelse:\n print("No")\n', 'h, n, *a = map(int, open(0).read().split())\n\nif sum(a) >= h:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s429521824', 's016370968'] | [2940.0, 13916.0] | [17.0, 41.0] | [93, 100] |
p02784 | u830162518 | 2,000 | 1,048,576 | 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`. | ["H,N=map(int,input().split())\nL=list(map(int,input().split()))\na=sum(L)\nif H>L:\n print('No')\nelse:\n print('Yes')\n ", "H,N=map(int,input().split())\nL=list(map(int,input().split()))\na=sum(L)\nif H>a:\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Accepted'] | ['s291150332', 's188558454'] | [13964.0, 14016.0] | [41.0, 41.0] | [121, 113] |
p02784 | u834832056 | 2,000 | 1,048,576 | 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`. | ['def attack(h, n, arr):\n print(sum(arr))\n h -= sum(arr)\n if h <= 0:\n return \'Yes\'\n else:\n return \'No\'\n\nif __name__ == "__main__":\n h, n = map(int, input().split())\n arr = list(map(int,input().split()))\n print(attack(h, n, arr))', 'def attack(h, n, arr):\n h -= sum(arr)\n if h <= 0:\n return \'Yes\'\n else:\n return \'No\'\n\nif __name__ == "__main__":\n h, n = map(int, input().split())\n arr = list(map(int,input().split()))\n print(attack(h, n, arr))'] | ['Wrong Answer', 'Accepted'] | ['s855225171', 's981667161'] | [13964.0, 13964.0] | [42.0, 41.0] | [261, 241] |
p02784 | u835090251 | 2,000 | 1,048,576 | 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`. | ['h,n=map(int,input().split())\na=list(map(int,input().split()))\nb=0\nfor i in range(n):\n b+=a[i]\nprint(b)', 'h,n=map(int,input().split())\na=list(map(int,input().split()))\nb=0\nfor i in range(n):\n b+=a[i]\nif h<=b:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s922452810', 's729193084'] | [20580.0, 20420.0] | [61.0, 64.0] | [103, 139] |
p02784 | u839954363 | 2,000 | 1,048,576 | 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`. | ['import math\nquery=[int(x) for x in input().split()]\nN = query[0]\nK = query[1]\nl=[int(x) for x in input().split()]\nSUM=sum(l)\nif N-SUM<=0:\n print("YES")\nelse:\n print("NO")', 'import math\nquery=[int(x) for x in input().split()]\nN = query[0]\nK = query[1]\nl=[int(x) for x in input().split()]\nSUM=sum(l)\nif N-SUM', 'import math\nquery=[int(x) for x in input().split()]\nN = query[0]\nK = query[1]\nl=[int(x) for x in input().split()]\nSUM=sum(l)\nif N-SUM<=0:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s235974774', 's539264145', 's246111896'] | [14012.0, 2940.0, 14016.0] | [44.0, 17.0, 44.0] | [175, 133, 175] |
p02784 | u841599623 | 2,000 | 1,048,576 | 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`. | ['H,N map(int, input().split())\nA = list(map(int, input().split()))\nfor Ax in A:\n H -= Ax\nif H < 0:\n print("Yes")\nelse:\n print("No")', 'H,N =map(int, input().split())\nA = list(map(int, input().split()))\nfor Ax in A:\n H -= Ax\nif H > 0:\n print("No")\nelse:\n print("Yes")'] | ['Runtime Error', 'Accepted'] | ['s602235440', 's775279721'] | [2940.0, 13964.0] | [17.0, 48.0] | [133, 134] |
p02784 | u844646164 | 2,000 | 1,048,576 | 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`. | ["H, N = map(int, input().split())\nA = list(map(int, input().split()))\n\nif sum(A) >= H:\n print('Yes')\nelse:", "H, N = map(int, input().split())\nA = list(map(int, input().split()))\n\nif sum(A) >= H:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s554753409', 's440628402'] | [2940.0, 13964.0] | [18.0, 41.0] | [106, 120] |
p02784 | u845620905 | 2,000 | 1,048,576 | 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`. | ['h, n = map(int, input().split())\n\na = list(map(int, input().split()))\n\na = sorted(a)\n\nif(a[0] + a[1] >= h):\n print("Yes")\nelse:\n print("No")', 'h, n = map(int, input().split())\n\na = list(map(int, input().split()))\n\na = sorted(a)\n\nif(sum(a) >= h):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s440329203', 's790773832'] | [14092.0, 13964.0] | [75.0, 79.0] | [146, 141] |
p02784 | u845847173 | 2,000 | 1,048,576 | 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`. | ['H, N = map(int, input().split())\nnumber = int(input())\nS = sum(number)\nif S / N >= H / N:\n print("Yes")\nelse:\n print("No")', 'H, N = map(int, input().split())\nnumber = int(input().count(N))\nS = sum(number)\nif S / N >= H / N:\n print("Yes")\nelse:\n print("No")', 'H, A = map(int, input().split())\nA = list(map(int, input().split()))\nif sum(A) >= H:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s026934624', 's998639628', 's378159633'] | [4468.0, 4468.0, 13964.0] | [23.0, 18.0, 48.0] | [128, 137, 123] |
p02784 | u846101221 | 2,000 | 1,048,576 | 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`. | ["h, n = map(int, input().split())\na = list(map(int, input().split()))\n\na_sum = 0\nfor a_i in sorted(a, reverse=True):\n a_sum += a_i\n if a_sum >= h:\n print('YES')\n break\nelse:\n print('NO')", "h, n = map(int, input().split())\na = list(map(int, input().split()))\n\nif sum(a) >= h:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s611347840', 's018902706'] | [13964.0, 13964.0] | [86.0, 41.0] | [208, 124] |
p02784 | u849761972 | 2,000 | 1,048,576 | 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`. | ['H, N = map(int, input().split())\na = list(map(int, input().split()))\n\nprint(sum(a))\n\nif H <= sum(a):\n print("Yes")\nelse:\n print("No")', 'H, N = map(int, input().split())\na = list(map(int, input().split()))\n\nif H <= sum(a):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s161564515', 's714087620'] | [14016.0, 13964.0] | [41.0, 40.0] | [139, 124] |
p02784 | u860234244 | 2,000 | 1,048,576 | 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`. | ['H,N = map(int,input().split(" "))\nA = list(map(int,input().split(" ")))\nflag = False\nfor i in range(N):\n H = H - A[i]\n if H <= 0:\n print("YES")\n flag = True\n break\nif flag == False:\n print("NO")\n \n ', 'H,N = map(int,input().split(" "))\nA = list(map(int,input().split(" ")))\nflag = False\nfor i in range(N):\n H -= A[i]\n if H <= 0:\n print("Yes")\n flag = True\n break\nif flag == False:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s672089522', 's724152245'] | [13964.0, 13964.0] | [57.0, 57.0] | [234, 221] |
p02784 | u861071267 | 2,000 | 1,048,576 | 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`. | ["import math\nH,N=map(int,input().split())\nA=list(map(int,input().split()))\n\nif H =< sum(A):\n print('Yes')\nelse:\n print('No')", "import math\nH,N=map(int,input().split())\nA=list(map(int,input().split()))\n\nif H <= sum(A):\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s525157033', 's568706766'] | [2940.0, 14012.0] | [17.0, 41.0] | [129, 129] |
p02784 | u863119020 | 2,000 | 1,048,576 | 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`. | ['hp, n = map(int, input().split())\na = map(int, input().split())\nprint("YES" if sum(a) >= hp else "NO")', 'hp, n = map(int, input().split())\na = map(int, input().split())\nprint("Yes" if sum(a) >= hp else "No")'] | ['Wrong Answer', 'Accepted'] | ['s093268295', 's294755597'] | [10712.0, 9944.0] | [38.0, 38.0] | [102, 102] |
p02784 | u863150907 | 2,000 | 1,048,576 | 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`. | ['H, N = map(int, input().split())\nA = list(map(int, input().split()))\n\nif sum(A) >= H:\n ans = "YES"\nelse:\n ans = "NO"', '\nH, N = map(int, input().split())\nA = list(map(int, input().split()))\n\nif sum(A) >= H:\n ans = "Yes"\nelse:\n ans = "No"\n\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s036641456', 's366957324'] | [13960.0, 13964.0] | [40.0, 43.0] | [122, 135] |
p02784 | u864276028 | 2,000 | 1,048,576 | 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`. | ["H,N = map(int, input().split())\nA = list(int(input().split()))\nif sum(A) >= H:\n print('Yes')\nelse:\n print('No')", "H,N = map(int, input().split())\nA = list(int(input()))\nif sum(A) >= H:\n print('Yes')\nelse:\n print('No')", "H,N = map(int, input().split())\nA = list(map(int, input().split()))\nif sum(A) >= H:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s006616985', 's937570083', 's375195558'] | [16500.0, 10088.0, 20548.0] | [34.0, 26.0, 51.0] | [113, 105, 118] |
p02784 | u870518235 | 2,000 | 1,048,576 | 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`. | ['# -*- coding: utf-8 -*-\n\n# Input\ns = [input() for i in range(2)]\nHN = (list(s[0].split()))\nA = (list(s[1].split()))\n\n# Proccess\nsum_a = 0\nfor i in range(int(HN[1])-1):\n sum_a = sum_a +int(A[i])\n \n# Output\t\t\t\t\t\t\t\nif int(sum_a) >= int(HN[0]):\n print("Yes")\nelse:\n print("No")', '# -*- coding: utf-8 -*-\n\n# Input\ns = [input() for i in range(2)]\nHN = (list(s[0].split()))\nA = (list(s[1].split()))\n\n# Proccess\nsum_a = 0\nfor i in range(int(HN[1])):\n sum_a = sum_a +int(A[i])\n \n# Output\t\t\t\t\t\t\t\nif int(sum_a) >= int(HN[0]):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s660557337', 's806548747'] | [11320.0, 10712.0] | [62.0, 53.0] | [277, 275] |
p02784 | u870559097 | 2,000 | 1,048,576 | 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`. | ['H, N=map(int, input().split())\nList=list(map(int,input().split()))\na = 0:\nfor j in range(N):\n a = a + List[j]\n\nif a >= H:\n print("Yes")\nelse:\n print("No")', 'H, N=map(int, input().split())\nList=[int(i) for i in input().split()]\na = 0:\nfor j in range(N):\n a = a + List[j]\n\nif a >= H:\n print("Yes")\nelse:\n print("No")', 'H, N=map(int, input().split())\nList=list(map(int,input().split()))\na = 0\nfor j in range(N):\n a = a + List[j]\n\nif a >= H:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s327386190', 's587176231', 's783562832'] | [2940.0, 2940.0, 13964.0] | [17.0, 17.0, 54.0] | [157, 160, 156] |
p02784 | u871934301 | 2,000 | 1,048,576 | 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`. | ['H,N=map(int,input().split())\nA=list(map(int,inout().split()))\nif H<=sum(A):\n print(Yes)\nelse:\n print(No)\n', 'H,N=map(int,input().split())\nA=list(map(int,input().split()))\nif H<=sum(A):\n print(Yes)\nelse:\n print(No)\n', 'H,N=map(int,input().split())\nA=list(map(int,input().split()))\nif H<=sum(A):\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s353036352', 's877380358', 's206879910'] | [2940.0, 13964.0, 13964.0] | [18.0, 40.0, 42.0] | [111, 111, 115] |
p02784 | u873190923 | 2,000 | 1,048,576 | 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`. | ["h,n = map(int, input().split())\ntotal = 0\nfor i in range(n):\n a = int(input())\n total += a\nif h >= total:\n print('Yes')\nelse:\n print('No')", "h,n = map(int, input().split())\na = list(map(int, input().split()))\ntotal = 0\nfor i in range(n):\n total += a[i]\nif total >= h:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s926718727', 's660710731'] | [4468.0, 13964.0] | [20.0, 54.0] | [150, 168] |
p02784 | u879870653 | 2,000 | 1,048,576 | 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`. | ['h,n = map(int,input().split())\nA = list(map(int,input().split()))\nA = sorted(A, reversed = True)\n\nfor a in A[:n] :\n h -= a\n\nif h <= 0 :\n print("Yes")\nelse :\n print("No")\n\n', 'h,n = map(int,input().split())\nA = list(map(int,input().split()))\nA = sorted(A, reverse = True)\n\nfor a in A[:n] :\n h -= a\n\nif h <= 0 :\n print("Yes")\nelse :\n print("No")\n\n'] | ['Runtime Error', 'Accepted'] | ['s132233910', 's110903366'] | [13964.0, 13964.0] | [40.0, 86.0] | [180, 179] |
p02784 | u886286585 | 2,000 | 1,048,576 | 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`. | ['n,m = map(int,input().split())\na = list(map(int,input().split()))\n\nif sum(a) > n:\n print("YES")\nelse:\n print("NO")', 'n,m = map(int,input().split())\na = list(map(int,input().split()))\n\nif sum(a) >= n:\n print("YES")\nelse:\n print("NO")', 'n,m = map(int,input().split())\na = list(map(int,input().split()))\n\nif sum(a) >= n:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s504225699', 's631825302', 's032774759'] | [13964.0, 13964.0, 13964.0] | [41.0, 41.0, 42.0] | [116, 117, 117] |
p02784 | u886478505 | 2,000 | 1,048,576 | 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`. | ['h, n = map(int, input().split())\na = input().split()\nb = 0\nfor i in range(n):\n b += int(a[i])\nif (h < b and has_duplicates(a) and len(a)>n ):\n print("No")\nelse:\n print("Yes")\n', 'h, n = map(int, input().split())\na = input().split()\nprint(a)\nb = 0\nfor i in range(n):\n b += int(a[i])\nif (h > b):\n print("Yes")\nelse:\n print("No")\n', 'h, n = map(int, input().split())\na = input().split()\nb = 0\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nfor i in range(n):\n b += int(a[i])\nif (h < b or has_duplicates(a) or len(a) > n ):\n print("No")\nelse:\n print("Yes")', 'h, n = map(int, input().split())\na = input().split()\nb = 0\nfor i in range(n):\n b += int(a[i])\nif (h < b and has_duplicates(a)):\n print("No")\nelse:\n print("Yes")\n', 'h, n = map(int, input().split())\na = input().split()\nb = 0\ndef has_duplicates(seq):\n return len(seq) != len(set(seq))\n\nfor i in range(n):\n b += int(a[i])\nif (h > b ):\n print("No")\nelse:\n print("Yes")'] | ['Runtime Error', 'Wrong Answer', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s527154112', 's605978727', 's704182145', 's910696263', 's543929396'] | [9944.0, 11916.0, 9952.0, 10712.0, 9944.0] | [70.0, 72.0, 77.0, 56.0, 57.0] | [184, 157, 246, 170, 211] |
p02784 | u898058223 | 2,000 | 1,048,576 | 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`. | ['H,N=map(int,input().split())\nA=list(map(int,input().split()))\nMax_A=0\nfor i in range(len(A)):\n Max_A=Max_A+A[i]\nif Max_A>=H:\n print("YES")\nelse:\n print("NO")', 'H,N=map(int,input().split())\nA=list(map(int,input().split()))\nMax_A=0\nfor i in range(len(A)):\n Max_A=Max_A+A[i]\nif Max_A>=H:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s944580632', 's537207127'] | [13964.0, 14016.0] | [54.0, 56.0] | [160, 160] |
p02784 | u901060001 | 2,000 | 1,048,576 | 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`. | ['H, N = (int(x) for x in input().split())\nA = [int(x) for x in input().split()]\n\nfor i in range(N):\n H - A[i]\n\nif H > 0:\n print("No")\nelse:\n print("Yes")\n', 'H, N = (int(x) for x in input().split())\nA = [int(x) for x in input().split()]\n\nfor i in range(N):\n H - A[0]\n\nif H > 0:\n print("No")\nelse:\n print("Yes")', 'H, N = (int(x) for x in input().split())\nA = [int(x) for x in input().split()]\n\nfor i in range(N):\n H = H - A[i]\n\nif H > 0:\n print("No")\nelse:\n print("Yes")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s558946161', 's860898976', 's725483544'] | [14016.0, 13788.0, 13964.0] | [55.0, 52.0, 57.0] | [162, 161, 166] |
p02784 | u901341592 | 2,000 | 1,048,576 | 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`. | ['H,N = list(map(int,input().split()))\nalist = list(map(int,input().split()))\nif H < sum(alist):\n print("YES")\nelse:\n print("NO")', 'H,N = list(map(int,input().split()))\nalist = list(map(int,input().split()))\nif H <= sum(alist):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s751076273', 's932079228'] | [13964.0, 13964.0] | [42.0, 40.0] | [129, 130] |
p02784 | u901598613 | 2,000 | 1,048,576 | 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`. | ['n,m=map(int,input().split())\nl=list(map(int,input().split()))\nd=sum(l)\nif n>l:\n print("No")\nelse:\n print("Yes")', 'n,m=map(int,input().split())\nl=list(map(int,input().split()))\nd=sum(l)\nif n>d:\n print("No")\nelse:\n print("Yes")'] | ['Runtime Error', 'Accepted'] | ['s140137014', 's680445464'] | [13964.0, 13964.0] | [42.0, 41.0] | [117, 117] |
p02784 | u901757711 | 2,000 | 1,048,576 | 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`. | ['h, a =map(int, input().split())\n\nif h % a != 0:\n print(h//a + 1)\nelse:\n print(h//a)', 'h, n = map(int, input().split())\na = list(map(int, input().split()))\nt = 0\n\nfor i in range(n):\n t += a[i]\n\nif h > t:\n print("No")\nelse:\n print("Yes")'] | ['Wrong Answer', 'Accepted'] | ['s668912235', 's316862483'] | [3060.0, 13964.0] | [17.0, 54.0] | [85, 158] |
p02784 | u904269060 | 2,000 | 1,048,576 | 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`. | ["H,N=map(int,input().split())\nA=list(map(int, input().split()))\nHP=H\n\nfor i in range(N):\n HP=HP-A[i]\n\nif HP<=0:\n print('YES')\nelif HP>0:\n print('NO')", "H,N=map(int,input().split())\nA=list(map(int, input().split()))\nHP=H\nfor i in range(N):\n HP-=A[i]\nif HP<=0:\n print('YES')\nelse:\n print('NO')", "H,N=map(int,input().split())\nA=list(map(int, input().split()))\nHP=H\nfor i in range(N):\n HP-=A[i]\nif HP<=0:\n print('YES')\nelse:\n print('NO')", "H,N=map(int,input().split())\nA=list(map(int, input().split()))\nHP=H\n\nfor i in range(N):\n HP=HP-A[i]\n\nif HP<=0:\n print('Yes')\nelif HP>0:\n print('No')"] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s308178661', 's787050683', 's929348021', 's958456952'] | [13964.0, 13964.0, 13964.0, 13964.0] | [54.0, 57.0, 56.0, 54.0] | [157, 148, 148, 157] |
p02784 | u904639778 | 2,000 | 1,048,576 | 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`. | ["h, n = input().split(' ')\nas = list(map(int, input().split(' ')))\n\nif sum(as) >= h:\n print('Yes')\nelse:\n print('No')", "h, n = list(map(int, input().split(' ')))\na = list(map(int, input().split(' ')))\n \nif sum(a) >= h:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s915647889', 's462533175'] | [2940.0, 14092.0] | [17.0, 40.0] | [118, 133] |
p02784 | u904995051 | 2,000 | 1,048,576 | 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`. | ['#ABC153B\nh,n = map(int,input().split())\na = list(map(int,inout().split()))\nprint("Yes" if sum(a) >= h else "No")', '#ABC153B\nh,n = map(int,input().split())\na = list(map(int,input().split()))\nprint("Yes" if sum(a) >= h else "No")'] | ['Runtime Error', 'Accepted'] | ['s434591225', 's680294835'] | [9008.0, 20540.0] | [27.0, 48.0] | [112, 112] |
p02784 | u905974390 | 2,000 | 1,048,576 | 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`. | ['h, n=map(int, input().split())\na=list(map(int, input().split()))\ndmg=0\nfor i in range(n):\n dmg+=a[i]\nif dmg<=0:\n print("Yes")\nelse:\n print("No")', 'h, n=map(int, input().split())\na=list(map(int, input().split()))\ndmg=0\nfor i in range(n):\n dmg+=a[i]\nif dmg>=h:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s634091171', 's400445076'] | [13964.0, 13964.0] | [55.0, 55.0] | [147, 147] |
p02784 | u906769651 | 2,000 | 1,048,576 | 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`. | ['import numpy as np\nH,N=input().split()\nH=int(H)\nN=int(N)\n\nA=list(map(int, input().split()))\n\ncount=0\nfor i in range(N):\n count+=A[i]\n\nif count=>H:\n print("yes")\nelse:\n print("no")', '# coding: utf-8\n# Your code here!\n\n\nh,a=map(int,input().split())\nA=list(map(int,input().split()))\nsum_A=sum(A)\nif h>sum_A:\n print("No")\n\nelse:\n print("Yes")'] | ['Runtime Error', 'Accepted'] | ['s340281613', 's888574894'] | [2940.0, 20580.0] | [17.0, 49.0] | [182, 162] |
p02784 | u906858931 | 2,000 | 1,048,576 | 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`. | ["H,N = map(int,input().split())\ntotal_attack_damage = sum(list(map(int,input().split())))\n\nresult = H = total_attack_damage\n\nif result <= 0:\n\tprint('Yes')\nelse:\n\tprint('No')", 'H,N = map(int,input().split())\ntotal_attack_damage = sum(list(map(int,input().split())))\n\nresult = H - total_attack_damage\nif result > 0:\n\tprint("NO")\nelif result <= 0:\n\tprint("YES")', "H,N = map(int,input().split())\ntotal_attack_damage = sum(list(map(int,input().split())))\n\nif H <= total_attack_damage:\n\tprint('YES')\nelse:\n\tprint('NO')", 'H,N = map(int,input().split())\ntotal_attack_damage = sum(list(map(int,input().split())))\n\nresult = H - total_attack_damage\nif result > 0:\n\tprint("No")\nelif result <= 0:\n\tprint("Yes")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s724752231', 's763619499', 's950383254', 's572844673'] | [13964.0, 13964.0, 13964.0, 14016.0] | [40.0, 41.0, 40.0, 40.0] | [172, 182, 151, 182] |
p02784 | u907223098 | 2,000 | 1,048,576 | 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`. | ["h,n = (int(i) for i in input().split())\na=input().split()\nif sum(a)>=h:\n print('Yes')\nelse:\n print('No')", "h,n = (int(i) for i in input().split())\na=[]\nfor i in input().split():\n a.append(int(i))\nif sum(a)>=h:\n print('Yes')\nelse:\n print('No')"] | ['Runtime Error', 'Accepted'] | ['s731401536', 's207968751'] | [10132.0, 14016.0] | [25.0, 53.0] | [106, 138] |
p02784 | u917066681 | 2,000 | 1,048,576 | 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`. | ['h, n = map(int , input().split())\na = list(map(int, input().split()))\nsum = 0\nfor i in range(n):\n sum += a[i]\nprint(sum)\nif (sum >= h):\n print("Yes")\nelse:\n print("No")', 'h, n = map(int , input().split())\na = list(map(int, input().split()))\nsum = 0\nfor i in range(n):\n sum += a[i]\nprint(sum)\nif (h <= sum):\n print("Yes")\nelse:\n print("No")', 'h, n = map(int , input().split())\na = list(map(int, input().split()))\nsum = 0\nfor i in range(n):\n sum += a[i]\nif (h <= sum):\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s772966640', 's995805273', 's132197061'] | [13964.0, 13964.0, 13964.0] | [55.0, 56.0, 57.0] | [177, 177, 166] |
p02784 | u918601425 | 2,000 | 1,048,576 | 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`. | ["H,N=[int(s) for s in input().split()]\nls=[int(s) for s in input().split()]\nif H<sum(ls):\n print('No')\nelse:\n print('Yes')", "H,N=[int(s) for s in input().split()]\nls=[int(s) for s in input().split()]\nif H>sum(ls):\n print('No')\nelse:\n print('Yes')\n"] | ['Wrong Answer', 'Accepted'] | ['s193176776', 's283914855'] | [13836.0, 13964.0] | [44.0, 44.0] | [123, 124] |
p02784 | u923270446 | 2,000 | 1,048,576 | 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`. | ['h, n = map(int, input().split())\na = list(map(int, input().split()))\nans = ""\nif sum(a) >= h:\n ans = "Yes"\nelse:\n ans = "No"', 'h, n = map(int, input().split())\na = list(map(int, input().split()))\nans = ""\nif sum(a) >= h:\n ans = "Yes"\nelse:\n ans = "No"\nprint(ans)'] | ['Wrong Answer', 'Accepted'] | ['s227091166', 's411922617'] | [13964.0, 13964.0] | [41.0, 41.0] | [126, 137] |
p02784 | u928784113 | 2,000 | 1,048,576 | 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`. | ['h,n = map(int,input().split())\na = list(map(int,input().split()))\np = sum(a)\nprint("Yes" if h < =p else "No")', 'h,n = map(int,input().split())\na = list(map(int,input().split()))\np = sum(a)\nprint("Yes" if h <= p else "No")'] | ['Runtime Error', 'Accepted'] | ['s351414779', 's920437944'] | [2940.0, 13964.0] | [17.0, 41.0] | [109, 109] |
p02784 | u940516059 | 2,000 | 1,048,576 | 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`. | ['H, N = map(int, input().split())\nA = sum(list(map(int, input().split())))\n\nif H <= A:\n print("YES")\nelse:\n print("NO")', 'H, N = map(int, input().split())\nA = [int(i) for i in input().split()]\n\nif sum(A) >= H:\n print("YES")\nelse:\n print("NO")', 'H, N = map(int, input().split())\nA = [int(i) for i in input().split()]\n\nif sum(A) >= H:\n print("YES")\nelse:\n print("NO")', 'H, N = map(int, input().split())\nA = sum(list(map(int, input().split())))\n\nif H <= A:\n print("YES")\nelse:\n print("NO")', 'h, n = map(int, input().split())\ns = sum(list(map(int, input().split())))\n\nif h <= s:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s256167289', 's644323560', 's719252494', 's794218469', 's689220408'] | [13964.0, 13964.0, 13836.0, 13964.0, 13964.0] | [40.0, 44.0, 44.0, 40.0, 44.0] | [124, 126, 126, 124, 124] |
p02784 | u942018172 | 2,000 | 1,048,576 | 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`. | ['l1 = input().strip().split()\nh = int(l1[0])\nn = int(l1[1])\na = sorted([int(i) for i in input().strip().split()], reverse=True)\nprint(a)\nif h < sum(a[:n]):\n print("Yes")\nelse:\n print("No")\n', 'l1 = input().strip().split()\nh = int(l1[0])\nn = int(l1[1])\nasum = sum([int(i) for i in input().strip().split()])\nif h <= asum:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s844475900', 's406824392'] | [13836.0, 13836.0] | [88.0, 44.0] | [194, 166] |
p02784 | u942505202 | 2,000 | 1,048,576 | 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`. | ["import numpy as np\n \nN, M = map(int, input().split())\nA = []\nA = map(int, input().split())\n \ndif = N - sum(A)\n \nif dif >= 0:\n print(dif)\nelse:\n print('-1')", "H, N = map(int, input().split())\nspecial_move = input().split()\ndef answer(H: int, N: int, special_move: list) -> str:\n damage = 0\n for i in range(0, N):\n damage += int(special_move[i])\n if damage >= H:\n return 'Yes'\n else:\n return 'No'\nprint(answer(H, N, special_move))"] | ['Wrong Answer', 'Accepted'] | ['s403254202', 's260563590'] | [35032.0, 16636.0] | [126.0, 55.0] | [157, 303] |
p02784 | u946433121 | 2,000 | 1,048,576 | 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`. | ["import sys\n\ndef main():\n\n \n\n h, n = map(int, input().split())\n a = list(map(int, input().split()))\n\n if h > sum(a):\n print('NO')\n else:\n print('YES')\n\nif __name__ == '__main__':\n main()\n", "import sys\n\ndef main():\n\n \n\n h, n = map(int, input().split())\n a = list(map(int, input().split()))\n\n if h > sum(a):\n print('No')\n else:\n print('Yes')\n\nif __name__ == '__main__':\n main()\n"] | ['Wrong Answer', 'Accepted'] | ['s324189918', 's634314298'] | [13964.0, 13964.0] | [41.0, 40.0] | [253, 253] |
p02784 | u948050032 | 2,000 | 1,048,576 | 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`. | ["H, N = map(int, input().split())\nA = list(map(int, input().split()))\nans = 'No'\nprint(H, N, A)\n\nfor i in A:\n H -= i\n if H <= 0:\n ans = 'Yes'\n break\n\nprint(ans)\n", "H, N = map(int, input().split())\nA = list(map(int, input().split()))\nans = 'No'\n\nfor i in A:\n H -= i\n if H <= 0:\n ans = 'Yes'\n break\n\nprint(ans)\n"] | ['Wrong Answer', 'Accepted'] | ['s330666851', 's324314840'] | [13964.0, 13964.0] | [61.0, 49.0] | [180, 165] |
p02784 | u948698724 | 2,000 | 1,048,576 | 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`. | ["H,N = map(int, input().split())\nlists = [] lists.append(int, input().split())\nlists = lists.sort()\nif N>=2 and lists[N-1]+lists[N-2]>=H:\n print('Yes')\nIf N==1 and lists[0]>=H:\n print('Yes')\nif N==1 and lists[0]<H:\n print('No')\nelse:\n print('No')", "H,N = map(int, input().split())\nlists = list(map(int, input().split()))\nlists.sort()\nSAM = sum(lists)\nif SAM>=H:\n print('Yes')\nelse:\n print('No')\n"] | ['Runtime Error', 'Accepted'] | ['s308049582', 's713226716'] | [8888.0, 20556.0] | [22.0, 61.0] | [249, 152] |
p02784 | u951425592 | 2,000 | 1,048,576 | 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`. | ["H, N = map(int,input().split())\nA = input().split()\n\nsumA = 0\nfor i in range(N):\n sumA += int(A[i])\n\n#print(A)\nif H-sumA <= 0:\n print('yes')\nelse:\n print('no')", "H, N = map(int,input().split())\nA = input().split()\n\nsumA = 0\nfor i in range(N):\n sumA += int(A[i])\n\n#print(A)\nif H-sumA <= 0:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s815417408', 's132106749'] | [10132.0, 10132.0] | [58.0, 61.0] | [162, 162] |
p02784 | u955691979 | 2,000 | 1,048,576 | 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`. | ['h,n = input().split()\nw = [0]*int(n)\n\nfor i in range(0,int(n)):\n w[i] = input()\n\nfor i in range(0,int(n)):\n h = int(h) - int(w[i])\n\nif(h<=0):\n print("Yes")\nelse:\n print("No")', 'h,n = input().split()\nw = input().split()\n\nfor i in range(0,int(n)):\n h = int(h) - int(w[i])\n\nif(h<=0):\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s176703927', 's919011395'] | [5028.0, 10420.0] | [19.0, 66.0] | [186, 145] |
p02784 | u956811090 | 2,000 | 1,048,576 | 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`. | ['H, N = map(int, input().split())\nA = map(int, input().split())\nsum = 0\n\nfor val in A\n\tsum = sum + val\n\nif sum >= H \n\tprint("Yes")\n \nprint("No")', 'H, N = map(int, input().split())\nA = list(map(int, input().split()))\nsum = 0\n\nfor val in A\n\tsum = sum + val\n\nif sum >= H \n\tprint("Yes")\n \nprint("No")\n', 'H, N = map(int, input().split())\nA = map(int, input().split())\nsum = 0\n\nfor val in A:\n\tsum = sum + val\n\nif sum >= H \n\tprint("Yes")\n \nprint("No")\n', 'H, N = map(int, input().split())\nA = list(map(int, input().split()))\nsum = 0\n\nfor val in A:\n\tsum = sum + val\n\nif sum >= H \n\tprint("Yes")\n \nprint("No")\n', 'H, N = map(int, input().split())\nA = map(int, input().split())\nsum = 0\n\nfor val in A:\n\tsum = sum + val\n\nif sum >= H:\n\tprint("Yes")\n \nprint("No")\n', 'H, N = map(int, input().split())\nA = map(int, input().split())\nsum = 0\n\nfor val in A:\n\tsum = sum + val\n\nif sum >= H:\n\tprint("Yes")\nelse: \n\tprint("No")\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Wrong Answer', 'Accepted'] | ['s012318080', 's116202933', 's181674835', 's345410898', 's421430384', 's579157564'] | [2940.0, 2940.0, 2940.0, 2940.0, 10712.0, 10132.0] | [17.0, 17.0, 17.0, 17.0, 53.0, 51.0] | [144, 151, 146, 152, 146, 152] |
p02784 | u957843607 | 2,000 | 1,048,576 | 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`. | ['H, N = map(int, input().split())\nlis = list(input().split())\nif sum(lis) >= H:\n print("Yes")\nelse:\n print("No")', 'H, N = map(int, input().split())\nlis = list(map(input().split()))\nif sum(lis) >= H:\n print("Yes")\nelse:\n print("No")', 'H, N = input().split()\nlis = list(map(int, input().split()))\nif sum(lis) >= H:\n print("Yes")\nelse:\n print("No")', 'H, N = map(int, input().split())\nlis = list(map(int, input().split()))\nif sum(lis) >= H:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s020746473', 's822813133', 's854688424', 's752766412'] | [10708.0, 10712.0, 13964.0, 13964.0] | [27.0, 25.0, 41.0, 40.0] | [113, 118, 113, 123] |
p02784 | u957957759 | 2,000 | 1,048,576 | 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`. | ["h,n=map(int,inuput().split())\na=list(map(int,input().split()))\n\nif h>sum(a):\n print('No')\nelse:\n print('Yes')", "h,n=map(int,input().split())\na=list(map(int,input().split()))\n\nif h>sum(a):\n print('No')\nelse:\n print('Yes')"] | ['Runtime Error', 'Accepted'] | ['s626838043', 's148941670'] | [2940.0, 13964.0] | [17.0, 40.0] | [115, 114] |
p02784 | u958210291 | 2,000 | 1,048,576 | 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`. | ["H,N = input().split()\nA = input().split()\nH = int(H)\nN = int(N)\nAintlist = [int(s) for s in A]\nprint(Aintlist)\nsumdata = 0\nfor i in range(0,len(Aintlist)):\n sumdata += Aintlist[i]\n\nif sumdata >= H:\n print('Yes')\nelse:\n print('No')", "H,N = input().split()\nA = input().split()\nH = int(H)\nN = int(N)\nAintlist = [int(s) for s in A]\nsumdata = 0\nfor i in range(0,len(Aintlist)):\n sumdata += Aintlist[i]\n\nif sumdata >= H:\n print('Yes')\nelse:\n print('No')"] | ['Wrong Answer', 'Accepted'] | ['s999946762', 's649033438'] | [15372.0, 13788.0] | [68.0, 59.0] | [239, 223] |
p02784 | u962858258 | 2,000 | 1,048,576 | 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`. | ['H,N = map(int,input().split())\na = 0\nfor i in range(N):\n c = int(input())\n a+=c\nif a>=H:\n print("Yes")\nelse:\n print("No")\n', 'H,N = map(int,input().split())\nA = list(map(int,input().split()))\na = 0\nfor i in A:\n a+=i\nif a>=H:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s946789443', 's000894853'] | [4260.0, 13964.0] | [21.0, 49.0] | [150, 152] |
p02784 | u963526071 | 2,000 | 1,048,576 | 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`. | ['a = input().split()\nh, n = int(a[0]), int(a[1])\nnums = input().split()\nnums = list(map(int, nums))\nx = sum(nums)\nif x >= h:\n print("yes")\nelse:\n print("no")\n', 'a = input().split()\nh, n = int(a[0]), int(a[1])\nnums = input().split()\nnums = list(map(int, nums))\nx = max(nums)\nxx = nums.index(x)\ndel nums[xx]\ny = max(nums)\nz = x + y\n\nif z >= h:\n print("yes")\nelse:\n print("no")', 'a = input().split()\nh, n = int(a[0]), int(a[1])\nnums = input().split()\nnums = list(map(int, nums))\nx = sum(nums)\n\nif x >= h:\n print("yes")\nelse:\n print("no")', 'a = input().split()\nh, n = int(a[0]), int(a[1])\nnums = input().split()\nnums = list(map(int, nums))\nnums = sorted(nums, reverse=True)\nx = nums[0] + nums[1]\nif x >= h:\n print("yes")\nelse:\n print("no")', 'a = input().split()\nh, n = int(a[0]), int(a[1])\nnums = input().split()\nnums = list(map(int, nums))\nx = h - sum(nums)\nif x <= 0:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Runtime Error', 'Wrong Answer', 'Runtime Error', 'Accepted'] | ['s349796170', 's464908933', 's556638506', 's718246393', 's155594096'] | [14092.0, 14016.0, 13960.0, 13964.0, 14016.0] | [41.0, 44.0, 41.0, 73.0, 40.0] | [159, 215, 159, 200, 163] |
p02784 | u964521959 | 2,000 | 1,048,576 | 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`. | ['A, B = map(int, input().split())\ninput_list = input().split( )\n\nfor i in (range(input_list)):\n input_list[i] = int(input_list)\n\ninput_sum = sum(input_list)\n\nif(A <= input_sum):\n print("Yes")\nelse:\n print("No")\n', 'A, B = map(int, input().split())\ninput_list = input().split( )\n\nfor i in (range(len(input_list))):\n input_list[i] = int(input_list)\n\ninput_sum = sum(input_list)\n\nif(A <= input_sum):\n print("Yes")\nelse:\n print("No")\n', 'A, B = map(int, input().split())\ninput_list = input().split( )\n\ninput_sum = sum(input_list)\n\nif(A <= input_sum):\n print("Yes")\nelse:\n print("No")', 'A, B = map(int, input().split())\ninput_list = input().split( )\n\nfor i in (range(len(input_list))):\n input_list[i] = int(input_list[i])\n\ninput_sum = sum(input_list)\n\nif(A <= input_sum):\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s190278947', 's367037886', 's373204934', 's870441714'] | [10424.0, 10132.0, 10580.0, 9944.0] | [26.0, 25.0, 25.0, 55.0] | [213, 218, 147, 221] |
p02784 | u966546644 | 2,000 | 1,048,576 | 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`. | ["H, N = map(int, input().split())\nAtack = list(map(int, input().split()))\n\ntotal = 0\nfor i in range(N):\n total += Atack[i-1]\n if total >= H:\n print('Yes')\n \nif total < H:\n print('No')", "H, N = map(int, input().split())\nAtack = list(map(int, input().split()))\n\nif sum(Atack) < H:\n print('No')\n \nelse:\n print('Yes')"] | ['Wrong Answer', 'Accepted'] | ['s578522862', 's392638456'] | [14092.0, 13964.0] | [65.0, 41.0] | [191, 130] |
p02784 | u968404618 | 2,000 | 1,048,576 | 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`. | ['211 5\n31 41 59 26 53', 'h, m = map(int, input().split())\nA = sum(list(map(int, input().split())))\n\nif h <= A:\n print("Yes")\nelse:\n print("No")'] | ['Runtime Error', 'Accepted'] | ['s262009456', 's329400287'] | [2940.0, 20664.0] | [18.0, 49.0] | [20, 124] |
p02784 | u977642052 | 2,000 | 1,048,576 | 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`. | ['def main(h: int, n: int, a: list):\n for i in sorted(a):\n h -= i\n if h <= 0:\n print("Yes")\n return\n\n print("No")\n\n\nif __name__ == "__main__":\n h, n = map(int, input().split())\n a = list(map(int, input().split()))\n', 'def main(h: int, n: int, a: list):\n for i in sorted(a):\n h -= i\n if h <= 0:\n print("Yes")\n return\n\n print("No")\n\n\nif __name__ == "__main__":\n h, n = map(int, input().split())\n a = list(map(int, input().split()))\n\n main(h, n, a)\n'] | ['Wrong Answer', 'Accepted'] | ['s516346315', 's378084383'] | [13964.0, 14016.0] | [43.0, 82.0] | [260, 279] |
p02784 | u984989720 | 2,000 | 1,048,576 | 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`. | ["H,N = map(int,input().split())\nA = list(map(int,input().split()))\n\n\nans = 'yes'\n\n\nif sum(A) < H:\n ans = 'No'\n\n\nprint(ans)\n", "H,N = map(int,input().split())\nA = list(map(int,input().split()))\nnew_A = sorted(A,reverse=True)\n\nans = 'yes'\n\nfor i in range(N + 1):\n if new_A[1] + new_A[2] < H:\n ans = 'No'\n if N < 2:\n ans = 'No'\n\nprint(ans)\n", "H,N = map(int,input().split())\nA = list(map(int,input().split()))\n\n\nans = 'Yes'\n\n\nif sum(A) < H:\n ans = 'No'\n\n\nprint(ans)"] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s825491552', 's970078923', 's794045268'] | [13964.0, 13964.0, 13964.0] | [40.0, 95.0, 40.0] | [125, 230, 124] |
p02784 | u987170100 | 2,000 | 1,048,576 | 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`. | ['H, N = map(int, input().split())\nlst = [int(x) for x in input().split()]\nif N >= sum(lst):\n print("Yes")\nelse:\n print("No")', 'H, N = map(int, input().split())\nlst = [int(x) for x in input().split()]\nif sum(lst) >= H:\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Accepted'] | ['s358804384', 's562293069'] | [13836.0, 13964.0] | [44.0, 44.0] | [129, 130] |
p02784 | u987637902 | 2,000 | 1,048,576 | 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`. | ['\n# ABC153\n\nh, n = map(int, input().split())\na = list(map(int, input().split()))\ns = sum(a)\nif a <= s:\n print("Yes")\nelse:\n print("No")\n', '# ABC153\n\nh, n = map(int, input().split())\na = list(map(int, input().split()))\ns = sum(a)\nif h <= s:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s611201002', 's129374723'] | [20600.0, 20376.0] | [46.0, 48.0] | [170, 169] |
p02784 | u991923581 | 2,000 | 1,048,576 | 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`. | ['s = input().split()\ns2 = list(map(int, input().split()))\n\nif sum(s2) >= int(s[0]):\n print("YES")\nelse:\n print("NO")', 's = input().split() \ns2 = list(map(int, input().split())) \n\nif sum(s2) > int(s[0]):\n print("YES")\nelse:\n print("NO")\n', 's = input().split() \ns2 = list(map(int, input().split())) \n\n# print(sum(s2))\n\n\nif sum(s2) >= int(s[0]):\n print("Yes")\nelse:\n print("No")\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s609845740', 's976846851', 's404129431'] | [13964.0, 13964.0, 13964.0] | [40.0, 41.0, 41.0] | [121, 145, 207] |
p02784 | u995004106 | 2,000 | 1,048,576 | 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`. | ['\nH,N=map(int, input().split())\nA=list(map(int,input().split()))\nA.sort()\ncount=0\nprint(A)\nfor i in range(N):\n count=count+A[i]\n\nif H<=count:\n print("Yes")\nelse:\n print("No")', '\nH,N=map(int, input().split())\nA=list(map(int,input().split()))\nA.sort(reverse=True)\ncount=0\n#print(A)\nfor i in range(N):\n count=count+A[i]\n\nif H<=count:\n print("Yes")\nelse:\n print("No")'] | ['Wrong Answer', 'Accepted'] | ['s569896691', 's298335644'] | [13964.0, 13964.0] | [97.0, 89.0] | [182, 195] |
p02784 | u995109095 | 2,000 | 1,048,576 | 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`. | ['a,b=map(int,input().split())\nl=list(map(int,input().split()))\nif max(l)>=a:\n\tprint(\'Yes\')\nelse:\n\tprint("No")\n', 'a,b=map(int,input(.split()))\naa=max(map(int,input().split()))\nif aa>=a:\n print("yes")\nelse:\n print(\'no\')\n', 'a,b=map(int,input(.split()))\naa=max(map(int,input().split()))\nif aa>=a:\n print("yes")\nelse:\n print(\'No\')\n', 'a,b=map(int,input(.split()))\n*aa,=map(int,input().split())\nif max(aa)>=a:\n print("yes")\nelse:\n print(\'no\')\n', 'a,b=map(int,input().split())\nl=list(map(int,input().spliit()))\nif max(l)>=a:\n\tprint(\'Yes\')\nelse:\n\tprint("No")', 'a,b=map(int,input().split())\nl=list(map(int,input().split()))\nif sum(l)>=a:\n\tprint(\'Yes\')\nelse:\n\tprint("No")\n'] | ['Wrong Answer', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Runtime Error', 'Accepted'] | ['s263637007', 's265284386', 's637211791', 's766286907', 's936108336', 's094901694'] | [14016.0, 2940.0, 2940.0, 2940.0, 4260.0, 14020.0] | [41.0, 17.0, 17.0, 17.0, 18.0, 44.0] | [109, 111, 111, 113, 109, 109] |
p02784 | u996434204 | 2,000 | 1,048,576 | 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`. | ['h,n = map(int,input().split())\nwaza = sorted([int(x) for x in input().split()],reverce=True)\n\nans=0\n\nfor i in range(n):\n ans+=waza[i]\n\nif ans >= h:\n print("Yes")\nelse:\n print("No")\n', 'h,n=map(int,input().split())\n\na=[int(x) for x in input().split()]\n\nflag=False\n\nfor aa in a:\n h-=aa\n if h <= 0:\n flag=True\n break\n \nif flag:\n print("Yes")\nelse:\n print("No")\n'] | ['Runtime Error', 'Accepted'] | ['s582307375', 's955344882'] | [13836.0, 13836.0] | [42.0, 55.0] | [190, 202] |
p02784 | u999983491 | 2,000 | 1,048,576 | 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`. | ['[H, N] = [int(x) for x in input().split()]\nA = list(map(int, input().split()))\ncount = 0\nfor x in A:\n count += x\nif count >= H:\n print("yes")\nelse:\n print("no")', '[H, N] = [int(x) for x in input().split()]\nA = list(map(int, input().split()))\ncount = 0\nfor x in A:\n count += x\nprint("Yes" if count >= H else "No")'] | ['Wrong Answer', 'Accepted'] | ['s956519317', 's361400406'] | [13960.0, 14092.0] | [48.0, 49.0] | [169, 152] |
p02785 | u005317312 | 2,000 | 1,048,576 | Fennec is fighting with N monsters. The _health_ of the i-th monster is H_i. Fennec can do the following two actions: * Attack: Fennec chooses one monster. That monster's health will decrease by 1. * Special Move: Fennec chooses one monster. That monster's health will become 0. There is no way other than Attack and Special Move to decrease the monsters' health. Fennec wins when all the monsters' healths become 0 or below. Find the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times. | ['import numpy as np\nN,K = map(int,input().split())\nH = list(map(int,input().split()))\nH.sort\nj=0\nif K >= N:\n print(N)\nelse:\n for i in range (N-K):\n j+=H[i]\n print(j+K)', 'import numpy as np\nN,K = map(int,input().split())\nH = list(map(int,input().split()))\nH.sort()\nj=0\nif K >= N:\n print(0)\nelse:\n for i in range (N-K):\n j+=H[i]\n print(j)'] | ['Wrong Answer', 'Accepted'] | ['s295649128', 's552846714'] | [34180.0, 34148.0] | [229.0, 297.0] | [182, 182] |
p02785 | u010262832 | 2,000 | 1,048,576 | Fennec is fighting with N monsters. The _health_ of the i-th monster is H_i. Fennec can do the following two actions: * Attack: Fennec chooses one monster. That monster's health will decrease by 1. * Special Move: Fennec chooses one monster. That monster's health will become 0. There is no way other than Attack and Special Move to decrease the monsters' health. Fennec wins when all the monsters' healths become 0 or below. Find the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times. | ['import sys\ninput = sys.stdin.readline\ninput_line = list(map(int,input().split()))\ninput_hp = list(map(int,input().split()))\n\ninput_hp.sort(reverse=True)\ntry:\n [input_hp.pop(_) for _ in range(input_line[1])]\n print(sum(input_hp))\nexcept IndexError:\n print(‘0’)', 'import sys\ninput = sys.stdin.readline\ninput_line = list(map(int,input().split()))\ninput_hp = list(map(int,input().split()))\ntry:\n [(input_hp.sort(reverse=True) ,input_hp.pop(_)) for _ in range(input_line[1])]\n print(sum(input_hp))\nexcept IndexError:\n print(‘0’)', "input_line = list(map(int,input().split()))\ninput_hp = list(map(int,input().split()))\n\nif input_line[0] <= input_line[1]:\n print('0')\nelse:\n input_hp.sort()\n result_input_hp = len(input_hp) - input_line[1]\n sum_total = sum(input_hp[:result_input_hp])\n print(sum_total)"] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s226788834', 's248632100', 's931759591'] | [2940.0, 3060.0, 26024.0] | [17.0, 17.0, 151.0] | [272, 274, 283] |
p02785 | u013956357 | 2,000 | 1,048,576 | Fennec is fighting with N monsters. The _health_ of the i-th monster is H_i. Fennec can do the following two actions: * Attack: Fennec chooses one monster. That monster's health will decrease by 1. * Special Move: Fennec chooses one monster. That monster's health will become 0. There is no way other than Attack and Special Move to decrease the monsters' health. Fennec wins when all the monsters' healths become 0 or below. Find the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times. | ['[n,k]=[int(x) for x in onput().split()]\nh=[int(x) for x in lnput().split()]\nif n<=k:\n print("0")\nelse:\n print(str(sum(h[k:])))', '[n,k]=[int(x) for x in input().split()]\nh=[int(x) for x in input().split()]\nh.sort()\nif n<=k:\n print("0")\nelse:\n print(str(sum(h[:len(h)-k])))'] | ['Runtime Error', 'Accepted'] | ['s993322039', 's579235645'] | [2940.0, 26764.0] | [17.0, 156.0] | [128, 144] |
p02785 | u018679195 | 2,000 | 1,048,576 | Fennec is fighting with N monsters. The _health_ of the i-th monster is H_i. Fennec can do the following two actions: * Attack: Fennec chooses one monster. That monster's health will decrease by 1. * Special Move: Fennec chooses one monster. That monster's health will become 0. There is no way other than Attack and Special Move to decrease the monsters' health. Fennec wins when all the monsters' healths become 0 or below. Find the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times. | ['N,K=map(int,input().split())\nH= list(map(int,input().split()))\n\ny=sorted(H)\ny.sort(reverse=True)\nx=0\nprint(x)\nfor i in range (K,N):\n x=x+y[i]\n \nprint(x)', 'special_moves = input().split(" ")\n\n_, special_moves = int(inputs[0]), int(inputs[1])\n\nhealth= input().split(" ")\nhealth= [int(h) for h in health]\nhealth.sort(reverse=True)\nprint(sum(health[special_moves:]))', 'nk = list(map(int,input().split()))\nn,k = nk\nh = list(map(int,input().split()))\nif k >= len(h):\n print(0)\nelse:\n h.sort()\n for i in range (k):\n h.pop()\n print(sum(h))'] | ['Wrong Answer', 'Runtime Error', 'Accepted'] | ['s090021247', 's260295874', 's440370586'] | [26356.0, 3060.0, 26180.0] | [184.0, 17.0, 162.0] | [158, 207, 185] |
p02785 | u024422110 | 2,000 | 1,048,576 | Fennec is fighting with N monsters. The _health_ of the i-th monster is H_i. Fennec can do the following two actions: * Attack: Fennec chooses one monster. That monster's health will decrease by 1. * Special Move: Fennec chooses one monster. That monster's health will become 0. There is no way other than Attack and Special Move to decrease the monsters' health. Fennec wins when all the monsters' healths become 0 or below. Find the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times. | ['N,K = map(int, input().split())\nA = list(map(int, input().split()))\n\nA.sort\nif N > K:\n for i in range(K):\n A.pop()\n print(A)\nelse:\n print("0")\n\n\n', 'N,K = map(int, input().split())\nA = list(map(int, input().split()))\n\nA.sort\nif N >= K:\n for i in range(K):\n A.pop()\n print(A)\nelse:\n print("0")\n\n', 'N,K = map(int, input().split())\nA = list(map(int, input().split()))\n\nA.sort()\nif N > K:\n for i in range(K):\n A.pop()\n print(sum(A))\nelse:\n print("0")\n\n\n'] | ['Wrong Answer', 'Wrong Answer', 'Accepted'] | ['s916775183', 's982549319', 's869926772'] | [26024.0, 26020.0, 26024.0] | [87.0, 88.0, 167.0] | [151, 151, 158] |
p02785 | u033524082 | 2,000 | 1,048,576 | Fennec is fighting with N monsters. The _health_ of the i-th monster is H_i. Fennec can do the following two actions: * Attack: Fennec chooses one monster. That monster's health will decrease by 1. * Special Move: Fennec chooses one monster. That monster's health will become 0. There is no way other than Attack and Special Move to decrease the monsters' health. Fennec wins when all the monsters' healths become 0 or below. Find the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times. | ['n,k=map(input().split())\nl=list(map(int,input().split()))\nl.sort()\nprint(sum(l[:n-k-1]))', 'n,k=map(int,input().split())\nl=list(map(int,input().split()))\nl.sort()\nprint(sum(l[:n-k]))\n//print(l)', 'n,k=map(int,input().split())\nh=list(map(int,input().split()))\nh.sort()\nprint(sum(h[:max(0,n-k)]))'] | ['Runtime Error', 'Runtime Error', 'Accepted'] | ['s039054897', 's907871070', 's089514376'] | [3060.0, 3064.0, 26024.0] | [17.0, 17.0, 156.0] | [88, 101, 97] |
p02785 | u034459102 | 2,000 | 1,048,576 | Fennec is fighting with N monsters. The _health_ of the i-th monster is H_i. Fennec can do the following two actions: * Attack: Fennec chooses one monster. That monster's health will decrease by 1. * Special Move: Fennec chooses one monster. That monster's health will become 0. There is no way other than Attack and Special Move to decrease the monsters' health. Fennec wins when all the monsters' healths become 0 or below. Find the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning when she can use Special Move at most K times. | ['n, k = (int(x) for x in input().split())\nH = list(map(int, input().split()))\nif k != 0:\n H.sort()\n del H[:k]\nprint(sum(H))', 'n, k = (int(x) for x in input().split())\nH = list(map(int, input().split()))\nH.sort(reverse=True)\nif k != 0:\n H.sort(reverse=True)\n del H[:k]\nprint(sum(H))'] | ['Wrong Answer', 'Accepted'] | ['s364749465', 's745520505'] | [26356.0, 26024.0] | [149.0, 156.0] | [128, 161] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.