a=list(map(int,input().rstrip().split()))
s=a[0]
n=a[1]
lst=[]
for i in range(n):
b=list(map(int,input().rstrip().split()))
lst.append(b)
lst.sort()
f=0
for j in lst:
if s>j[0]:
s+=j[1]
f+=1
if f==len(lst):
print("YES")
else:
print("NO")
#include<bits/stdc++.h>
using namespace std;
int main()
{
int s,n,count=0;
cin>>s>>n;
pair <int,int > val[10000];
for (int i =0;i<n;i++)
{
cin>>val[i].first>>val[i].second;
}
sort (val,val+n);
for (int i =0 ;i< n;i++)
{
if (s<=val[i].first)
{
count++;
break;
}
else
{
s=s+val[i].second;
}
}
if (count > 0 )
{
cout<<"NO"<<endl;
}
else
{
cout<<"YES"<<endl;
}
}
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |