10840: ABC153 - B - Common Raccoon vs Monster
[Creator : ]
Description
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
Input is given from Standard Input in the following format:
```
$H$ $N$
$A_1$ $A_2$ $...$ $A_N$
```
```
$H$ $N$
$A_1$ $A_2$ $...$ $A_N$
```
Output
If Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.
Constraints
- $1 \leq H \leq 10^9$
- $1 \leq N \leq 10^5$
- $1 \leq A_i \leq 10^4$
- All values in input are integers.
- $1 \leq N \leq 10^5$
- $1 \leq A_i \leq 10^4$
- All values in input are integers.
Sample 1 Input
10 3
4 5 6
Sample 1 Output
Yes
The monster's health will become $0$ or below after, for example, using the second and third moves.
Sample 2 Input
20 3
4 5 6
Sample 2 Output
No
Sample 3 Input
210 5
31 41 59 26 53
Sample 3 Output
Yes
211 5
31 41 59 26 53
No