HDU 3177

Crixalis's Equipment

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1491 Accepted Submission(s): 611

Problem Description

Crixalis - Sand King used to be a giant scorpion(蝎子) in the deserts of Kalimdor. Though he's a guardian of Lich King now, he keeps the living habit of a scorpion like living underground and digging holes.

Someday Crixalis decides to move to another nice place and build a new house for himself (Actually it's just a new hole). As he collected a lot of equipment, he needs to dig a hole beside his new house to store them. This hole has a volume of V units, and Crixalis has N equipment, each of them needs Ai units of space. When dragging his equipment into the hole, Crixalis finds that he needs more space to ensure everything is placed well. Actually, the ith equipment needs Bi units of space during the moving. More precisely Crixalis can not move equipment into the hole unless there are Bi units of space left. After it moved in, the volume of the hole will decrease by Ai. Crixalis wonders if he can move all his equipment into the new hole and he turns to you for help.

 

Input

The first line contains an integer T, indicating the number of test cases. Then follows T cases, each one contains N + 1 lines. The first line contains 2 integers: V, volume of a hole and N, number of equipment respectively. The next N lines contain N pairs of integers: Ai and Bi.
0<T<= 10, 0<V<10000, 0<N<1000, 0 <Ai< V, Ai <= Bi < 1000.

 

Output

For each case output "Yes" if Crixalis can move all his equipment into the new hole or else output "No".

 

Sample Input

2 20 3 10 20 3 10 1 7 10 2 1 10 2 11

 

Sample Output

Yes No

 

/*
bool cmp(const S &s1, const S &s2){  
    if(s1.a + s2.b == s2.a + s1.b)  
        return s1.b < s2.b;  
    return s1.a + s2.b < s2.a + s1.b;  
    //return s1.b - s1.a > s2.b - s2.a;  也可   
}  
我们设第一件物品的占用空间和搬运所需空间分别为A1和B1，第二件为A2和B2，则：
先搬第一件物品所需最大临时空间为A1 + B2，先搬第二件物品所需的最大临时空间为A2 + B1，那么很明显应该选择所需最大临时空间较小的方案。
*/
#include <iostream>
#include <cstring>
#include <cstdlib>
using namespace std;

typedef struct Node
{
    int a,b;
}Node;
Node ch[1005];

int cmp(const void *a,const void *b)
{
    Node *c = (Node *)a;
    Node *d = (Node *)b;
    if(d->b != c->b)
        return (d->b-d->a)- (c->b - c->a);
    else
        return c->a - d->a; 
}

int main()
{
    int i,j,k,t,T;
    cin>>T;
    int v,n;
    while(T--)
    {
        memset(ch,0,sizeof(ch));
        cin>>v>>n;
        int x,y;
        for(i=1;i<=n;i++)
        {
            cin>>x>>y;
            ch[i].a = x,ch[i].b = y;
        }
        qsort(&ch[1],n,sizeof(Node),cmp);
        for(i=1;i<=n;i++)
        {
            if(v>=ch[i].b&&v>=ch[i].a)//实际上第二个条件没必要，因为说了b>a,加上保险些 
                v -= ch[i].a;
            else
                break;
        }
        if(i>n)
            cout<<"Yes"<<endl;
        else
            cout<<"No"<<endl;
    }
    return 0;
}