CodeForces 230A. Dragons

http://codeforces.com/problemset/problem/230/A
简单题 只需注意下对于结构体种某个元素的排序，自己写cmp函数的写法

#include<iostream>
#include<algorithm> 
using namespace std;
struct dragon{
    int x;
    int y;
};
dragon d[1005];
int cmp(const dragon a,const dragon b)
{
    return a.x<b.x;
}
int main()
{
    int s,n;
    cin>>s>>n;
    for(int i = 0;i<n;i++)
    {
        cin>>d[i].x;
        cin>>d[i].y;
    }
    sort(d,d+n,cmp);
//  for(int i = 0;i<n;i++)
//  {
//      cout<<d[i].x<<" "<<d[i].y<<endl;
//  }
    int i;
    for(i = 0;i<n;i++)
    {
        if(s>d[i].x){
            s+=d[i].y;
        }
        else break;
    }
    if(i == n) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    return 0;
}