engineering recuitment GATE CSE 2023-24 Test Series Algorithms Algorithm Design Techniques Dynamic Programming
Consider the following items with their associated weights and values.
| Item | Weight | Value |
| 1 | 4 | 44 |
| 2 | 7 | 21 |
| 3 | 5 | 38 |
| 4 | 2 | 11 |
| 5 | 7 | 40 |
| 6 | 10 | 37 |
| 7 | 3 | 13 |
If a knapsack of capacity 22 units of weight is available and it is allowed to take either the item completely or leave it, the maximum possible profit using the dynamic approach will be _____.
Enter numerical value using the virtual keypad. Round off where necessary.