Women's Shoes and Bags

Accepted Necklace
Problem Description
I have N precious stones, and plan to use K of them to make a
necklace for my mother, but she won accept a necklace which is
too heavy. Given the value and the weight of each precious stone,
please help me find out the most valuable necklace my mother will
accept.

Input
The first line of input is the number of cases.
For each case, the first line contains two integers N (N
<= 20), the total number of stones, and K (K
<= N), the exact number of stones to make a
necklace.
Then N lines follow, each containing two integers: a
(a <= 1000), representing the value of each precious
stone, and b (b <= 1000), its weight.
The last line of each case contains an integer W, the maximum
weight my mother will accept, W <= 1000.

Output
For each case, output the highest possible value of the
necklace.

Sample Input
1
2 1
1 1
1 1
3

Sample Output

1

Source
HDU special Open boys - in time for the girls before the holidays (From WHU) < br />

————————— started when the violent search – —————————–< br /> is to do some blind can not see some “pruning”, in fact, does not count on pruning, but some of the constraints ah
TLE:
# include
int ANS, N, K, W, a [22], b [22], v [22 ];
void DFS (int val, int weight, int num)
{
if (num == K
)
{
if (ANS> val)
ANS = val;
return;
}
else
{
for (int i = 0;
i {
if ( v [i] == 0