hdu 2660 Accepted Necklace

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2660

题意：有n颗宝石，要第I颗重wi，价值vi，从中选择k个组成一串宝石，要求重量小于W，求最大价值

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 21;
int w[maxn],v[maxn],vis[maxn];
int Max,k,n;
int W;
void dfs(int cur,int sum,int wsum,int pre)
{
	if(cur==k)
	{
		if(Max<sum)Max=sum;
		return;
	}
	else
	{
		for(int i=pre;i<n;i++)
		{
			if(!vis[i]&&wsum+w[i]<=W)
			{
				vis[i]=1;
				dfs(cur+1,sum+v[i],wsum+w[i],i);
				vis[i]=0;
			}
		}
	}
}
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		Max = -(1<<30);
		scanf("%d%d",&n,&k);
		for(int i=0;i<n;i++)
		scanf("%d%d",&v[i],&w[i]);
		scanf("%d",&W);
		dfs(0,0,0,0);
		printf("%d\n",Max);
	}
}