-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path01Knap.cpp
More file actions
80 lines (67 loc) · 2 KB
/
01Knap.cpp
File metadata and controls
80 lines (67 loc) · 2 KB
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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include <iostream>
using namespace std;
class Knapsack {
int n, capacity;
int *weights, *values, **dp;
public:
Knapsack(int items, int cap) {
n = items;
capacity = cap;
// Dynamically allocate arrays
weights = new int[n];
values = new int[n];
// Dynamic allocation for DP table
dp = new int*[n + 1];
for (int i = 0; i <= n; i++)
dp[i] = new int[capacity + 1];
// Initialize DP table with 0
for (int i = 0; i <= n; i++)
for (int j = 0; j <= capacity; j++)
dp[i][j] = 0;
}
void inputItems() {
cout << "Enter weights and values of items:\n";
for (int i = 0; i < n; i++) {
cin >> weights[i] >> values[i];
}
}
void solveKnapsack() {
for (int i = 1; i <= n; i++) {
for (int w = 1; w <= capacity; w++) {
if (weights[i - 1] <= w) {
int includeItem = values[i - 1] + dp[i - 1][w - weights[i - 1]];
int excludeItem = dp[i - 1][w];
// Replacing max function manually
if (includeItem > excludeItem)
dp[i][w] = includeItem;
else
dp[i][w] = excludeItem;
} else {
dp[i][w] = dp[i - 1][w];
}
}
}
}
void printSolution() {
cout << "Maximum value in Knapsack: " << dp[n][capacity] << endl;
}
~Knapsack() {
// Free dynamically allocated memory
delete[] weights;
delete[] values;
for (int i = 0; i <= n; i++)
delete[] dp[i];
delete[] dp;
cout << "Memory freed\n";
}
};
int main() {
int n, capacity;
cout << "Enter number of items and knapsack capacity: ";
cin >> n >> capacity;
Knapsack knapsack(n, capacity);
knapsack.inputItems();
knapsack.solveKnapsack();
knapsack.printSolution();
return 0;
}