hdu acm-step 1.3.8 Crixalis's Equipment

#include <cstdio>
#include <algorithm>
using namespace std;
struct Node
{
        int A,B;
        bool operator < (const Node &node){if(B-A>node.B-node.A)return true;else if(B - A< node.B - node.A)return false;if(A < node.A)return true;return false;}
};
Node a[1000];
int main()
{
        int T;
        scanf("%d",&T);
        while(T--)
        {
                int V,N;
                scanf("%d%d",&V,&N);
                for(int i=0;i<N;i++)scanf("%d%d",&a[i].A,&a[i].B);
                sort(a,a+N);
                int sum=0,i;
                for(i=0;i<N;i++){if(a[i].B > V-sum)break;sum+=a[i].A;}
                if(i!=N||sum>V)printf("No\n");
                else printf("Yes\n");
        }
        return 0;
}