-
Notifications
You must be signed in to change notification settings - Fork 0
/
FOODIE - FOODIE.cpp
55 lines (52 loc) · 1.16 KB
/
FOODIE - FOODIE.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include<bits/stdc++.h>
#define Copy_maris_nah int main()
#define Okay_bye return 0
using namespace std;
int knapsack(int n,int m,int w[],int p[]);
Copy_maris_nah
{
int t,n,m,r,i,sum,max,w[210],p[210];
cin>>t;
while(t--)
{
int item;
max=0;
cin>>n>>m;
for(i=1; i<=n; i++)
{
sum=0;
cin>>r;
while(r--)
{
cin>>item;
sum+=item;
}
w[i]=p[i]=sum;
}
max=knapsack(n,m,w,p);
cout<<max<<endl;
}
Okay_bye;
}
int knapsack(int n,int m,int w[],int p[])
{
int b[300][300],i,j;
for(i=0; i<=n; i++)
b[i][0]=0;
for(j=0; j<=m; j++)
b[0][i]=0;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
{
if(w[i]<=j)
{
if(p[i]+b[i-1][j-w[i]] > b[i-1][j])
b[i][j]=p[i]+b[i-1][j-w[i]];
else
b[i][j]=b[i-1][j];
}
else
b[i][j]=b[i-1][j];
}
return (b[n][m]);
}