forked from AdarshAddee/Hacktoberfest2022_for_Beginers
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Knapsack Problem by Suraj.cpp
66 lines (66 loc) · 1.37 KB
/
Knapsack Problem by Suraj.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
56
57
58
59
60
61
62
63
64
65
66
#include<iostream>
#define MAX 10
using namespace std;
struct product
{
int product_num;
int profit;
int weight;
float ratio;
float take_quantity;
};
int main()
{
product P[MAX],temp;
int i,j,total_product,capacity;
float value=0;
cout<<"ENTER NUMBER OF ITEMS : ";
cin>>total_product;
cout<<"ENTER CAPACITY OF SACK : ";
cin>>capacity;
cout<<"\n";
for(i=0;i<total_product;++i)
{
P[i].product_num=i+1;
cout<<"ENTER PROFIT AND WEIGHT OF PRODUCT "<<i+1<<" : ";
cin>>P[i].profit>>P[i].weight;
P[i].ratio=(float)P[i].profit/P[i].weight;
P[i].take_quantity=0;
}
//HIGHEST RATIO BASED SORTING
for(i=0;i<total_product;++i)
{
for(j=i+1;j<total_product;++j)
{
if(P[i].ratio<P[j].ratio)
{
temp=P[i];
P[i]=P[j];
P[j]=temp;
}
}
}
for(i=0;i<total_product;++i)
{
if(capacity==0)
break;
else if(P[i].weight<capacity)
{
P[i].take_quantity=1;
capacity-=P[i].weight;
}
else if(P[i].weight>capacity)
{
P[i].take_quantity=(float)capacity/P[i].weight;
capacity=0;
}
}
cout<<"\n\nPRODUCTS TO BE TAKEN -";
for(i=0;i<total_product;++i)
{
cout<<"\nTAKE PRODUCT "<<P[i].product_num<<" : "<<P[i].take_quantity*P[i].weight<<" UNITS";
value+=P[i].profit*P[i].take_quantity;
}
cout<<"\nTHE KNAPSACK VALUE IS : "<<value;
return 0;
}