南阳311----完全背包

//完全背包，可通过另一数组存重量的最大价值进行优化
#include<iostream>
#define inf 1<<29
using namespace std;
int Room;
int bag[50005];

void init(int n)
{
    bag[0] = 0;
    for(int i=1; i<=n; ++i)
        bag[i] = -inf;
}

void complete_bag(int r,int v)
{
    for(int i=r; i<=Room; ++i)
        if(bag[i-r]+v > bag[i])
            bag[i] = bag[i-r] + v;
}

int main()
{
    int n,num,room,val;
    cin >> n;
    while(n--)
    {
        cin >> num >> Room;
        init(Room);
        while(num--)
        {
            cin >> room >> val;
            complete_bag(room,val);
        }
        if(bag[Room] > 0)
            cout << bag[Room] << endl;
        else
            cout << "NO" << endl;
    }
    return 0;
}