简单的DFS

题目：
I have N precious stones, and plan to use K of them to make a necklace for my mother, but she won’t 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.

大致题意：
我有N块宝石，并计划使用其中的K块为我的母亲制作项链，但她不会接受太重的项链。考虑到每种宝石的价值和重量，请帮助我找出母亲会接受的最有价值的项链。

题解：
一道简单的DFS题，规定了组成项链的宝石数，再规定的重量范围内价值最大，这道题仔细分析就会发现一个宝石只有要与不要两种情况，又数据范围小，那么，我们可以直接强行把所用可能考虑进去，用递归，情况分为两种分别递归，求其中价值最大的一种情况。

代码如下：

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>

using namespace std;

int T,n,k,a[30],b[30],da;

int dfs(int num,int math,int val,int wei,int max_num,int max_wei)
{
	if(wei>max_wei) return 0;
	if(math==max_num) return val;
	if(num==n) return 0;
	int x=dfs(num+1,math+1,val+a[num],wei+b[num],max_num,max_wei);
	int y=dfs(num+1,math,val,wei,max_num,max_wei);
	return max(x,y);
}

int main()
{
	cin>>T;
	while(T--)
	{
		cin>>n>>k;
		for(int i=0;i<n;i++) cin>>a[i]>>b[i];
		cin>>da;
		cout<<dfs(0,0,0,0,k,da)<<endl;
	}
	return 0;
}