5/7/24, 12:54 PM Knapsack-Dynamic Programming: Attempt review

Started on Tuesday, 16 April 2024, 7:51 PM

State Finished
Completed on Tuesday, 16 April 2024, 8:09 PM
Time taken 18 mins 17 secs
Name PRITHIV G 2022-CSBS-B

https://www.rajalakshmicolleges.net/moodle/mod/quiz/review.php?attempt=767895&cmid=6790 1/3
5/7/24, 12:54 PM Knapsack-Dynamic Programming: Attempt review

Question 1

Correct

Marked out of 1.00

Input

10 20 30

60 100 120

50
Output

220

Answer: (penalty regime: 0 %)

1 #include<stdio.h>
2 int max(int a, int b);
3 int knapsack(int w,int wt[],int val[],int b);
4 int main()
5 ▼ {
6 int n,w;
7 scanf("%d",&n);
8 int val[n],wt[n];
9 for(int i=0;i<n;i++)
10 ▼ {
11 scanf("%d",&wt[i]);
12 }
13 for(int i=0;i<n;i++)
14 ▼ {
15 scanf("%d",&val[i]);
16 }
17 scanf("%d",&w);
18 printf("%d",knapsack(w,wt,val,n));
19 return 0;
20 }
21 int knapsack(int w,int wt[],int val[],int n)
22 ▼ {
23 int i,j;
24 int v[n+1][w+1];
25 for(i=0;i<=n;i++)
26 ▼ {
27 for(j=0;j<=w;j++)
28 ▼ {
29 if(i==0||j==0)
30 v[i][j]=0;
31 else if(j-wt[i-1]>=0)
32 ▼ {
33 v[i][j]=max(val[i-1]+v[i-1][j-wt[i-1]],v[i-1][j]);
34 }
35 else
36 v[i][j]=v[i-1][j];
37 }
38 }
39 return v[n][w];
40 }
41 int max(int a, int b)
42 ▼ {
43 return(a>b)?a:b;
44 }
45

https://www.rajalakshmicolleges.net/moodle/mod/quiz/review.php?attempt=767895&cmid=6790 2/3
5/7/24, 12:54 PM Knapsack-Dynamic Programming: Attempt review

Input Expected Got

 3 220 220 
10 20 30
60 100 120
50

Passed all tests! 

https://www.rajalakshmicolleges.net/moodle/mod/quiz/review.php?attempt=767895&cmid=6790 3/3