Accepted Necklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2586 Accepted Submission(s): 1029
Problem Description
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.
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
#include<stdio.h>
#include<string.h>
#define MAX 30
int v[MAX],w[MAX];
int visit[MAX];
int s;
int n,k;
int max;
void dfs(int curv,int curw,int curk,int dex){
if(curw==s||curk==k){
if(max<curv)
max=curv;
}
else if(curw<s&&curk<k){
int i;
for(i=dex;i<n;i++){
if(!visit[i]&&(curw+w[i])<=s&&(curk+1)<=k){
visit[i]=1;
dfs(curv+v[i],curw+w[i],curk+1,i+1);
visit[i]=0;
}
}
}
}
int main(){
int t;
scanf("%d",&t);
while(t--){
scanf("%d%d",&n,&k);
int i;
for(i=0;i<n;i++){
scanf("%d%d",&v[i],&w[i]);
}
scanf("%d",&s);
memset(visit,0,sizeof(visit));
max=0;
dfs(0,0,0,0);
printf("%d\n",max);
}
return 0;
}