-
Notifications
You must be signed in to change notification settings - Fork 0
/
Knapsack
123 lines (98 loc) · 2.22 KB
/
Knapsack
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
/// Header file begin
#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#include <string>
#include <vector>
#include <cmath>
#include <cctype>
#include <sstream>
#include <set>
#include <list>
#include <stack>
#include<utility>
#include <queue>
#include <algorithm>
#define pf printf
#define sf scanf
/// Macros for Graph
#define white 0
#define gray 1
#define black -1
#define nil -2
using namespace std;
int dp[100][100],backtrack[100][100];
struct my
{
int weight;
int price;
};
my ar[100];
void print_element(int i, int j)
{
if(dp[i][j] == 0)
{
return;
}
if(backtrack[i][j] == 1)
{
print_element(i-1,j-ar[i].weight);
pf("%d ",i);
}
else
{
print_element(i-1,j);
}
}
int main()
{
// mem(dp,0);
int maximum_weight, item;
//cin >> maximum_weight >> item;
pf("Enter maximum weight and no. of item: ");
sf("%d %d",&maximum_weight,&item);
pf("Enter weight and their Price:\n");
for(int i=1;i<=item;i++)
{
cin >> ar[i].weight >> ar[i].price;
}
for(int i=1;i<=item;i++)
{
for(int j=1;j<=maximum_weight;j++)
{
if(ar[i].weight <= j)
{
//dp[i][j] = max(dp[i-1][j], (ar[i].price + (dp[i-1][j-ar[i].weight])));
int a=dp[i-1][j] , b = ar[i].price + (dp[i-1][j-ar[i].weight]);
if(a>=b)
{
dp[i][j] = a;
backtrack[i][j] = 0;
}
else
{
dp[i][j] = b;
backtrack[i][j] = 1;
}
}
else
{
dp[i][j] = dp[i-1][j];
}
}
}
pf("Knapsack Matrix:\n");
for(int i=0;i<=item;i++)
{
for(int j=0;j<=maximum_weight;j++)
{
cout << dp[i][j] << " ";
}
pf("\n");
}
pf("Answer: %d\nElements are: ",dp[item][maximum_weight]);
print_element(item,maximum_weight);
//}
return 0;
}