Problem:
Score : 200 points

Problem Statement

Raccoon is fighting with a monster.

The health of the monster is H.

Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i.
There is no other way to decrease the monster's health.

Raccoon wins when the monster's health becomes 0 or below.

If Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.

Constraints

1 \leq H \leq 10^9

1 \leq N \leq 10^5

1 \leq A_i \leq 10^4

All values in input are integers.

Input

Input is given from Standard Input in the following format:

H N
A_1 A_2 ... A_N

Output

If Raccoon can win without using the same move twice or more, print Yes; otherwise, print No.

Sample Input 1

10 3
4 5 6

Sample Output 1

Yes

The monster's health will become 0 or below after, for example, using the second and third moves.

Sample Input 2

20 3
4 5 6

Sample Output 2

No

Sample Input 3

210 5
31 41 59 26 53

Sample Output 3

Yes

Sample Input 4

211 5
31 41 59 26 53

Sample Output 4

No

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define bitoff(val,pos) val & ~(1<<pos)
#define biton(val,pos) val | (1<<pos)
#define bittgl(val,pos) val ^ (1<<pos)
#define bitchk(val,pos) (bool)(val & (1<<pos))
#define odevn(val,pos) (bool)(val & (1<<pos))
#define bitcnt(val) __builtin_popcount(val)
ll ar[1000000],br[1000000],vis[1000009],cm[1000009],ck,n,r,sum,k,sm;
string st;
vector<ll>vec;
vector<ll>vec2[200009];
queue<ll>qq;
stack<ll>stk;
map<string,ll>mp;map<ll,ll>mp1;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll min1=9999999999;
    ll i,j,e,d,t,s=0;
    sum=0;
    double dd,vv,gg;
    cin >> d >> t;
    for(i=1;i<=t;i++)
    {
        cin >> j;
        sum+=j;
    }
    if(sum>=d)
    {
        cout << "YES" << endl;
    }
    else
        cout << "NO" << endl;
}