230A:Dragons

Problem Link

#include<bits/stdc++.h>
using namespace std;
pair<int,int>a[10000];
int main()
{
int i,n,s,flag=0;
cin>>s>>n;
for(i=0;i<n;i++) { cin>>a[i].first>>a[i].second;
}
sort(a,a+n);
for(i=0;i<n;i++) { if(s>a[i].first)
{
s+=a[i].second;
}
else{
cout<<“NO”<<endl;
return 0;
}
}

cout<<“YES”<<endl;
}

Advertisements

About waprogramming

I am in CSE,from CUET
This entry was posted in Codeforces, Uncategorized and tagged , , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s