practise_contest_2_q_2

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int s, n; cin >> s >> n;
    vector<pair<int, int>> v(n);
    for (int i = 0; i < n; i++)
    {
        cin >> v[i].first >> v[i].second;//xi and yi
    }
    //goal is to defeat the all the dragons
    //strategy->kill the dragon with low strength first
    sort(v.begin(), v.end());
    bool flag = true;
    for (int i = 0; i < n; i++)
    {
        if (s > v[i].first)
        {
            s += v[i].second;
        }
        else
        {
            flag = false; break;
        }
    }

    if (flag) cout << "YES" << endl;
    else cout << "NO" << endl;
}