-
Notifications
You must be signed in to change notification settings - Fork 57
/
fractionalknapsack.cpp
55 lines (49 loc) · 1.25 KB
/
fractionalknapsack.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
/*==============================|-problem statement-|==============================*/
/*
Implement fractional knapsack problem
*/
/*===================================|-solution-|===================================*/
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
class item{
public:
int weight;
float cost;
float costPerItem;
item(int weight, float cost){
this-> weight = weight;
this -> cost = cost;
this-> costPerItem = cost/weight;
}
};
bool comparator( const item &l, const item &r) {
return l.costPerItem > r.costPerItem;
}
int main(int argc, char const *argv[])
{
int n,w,c,maxW,profit = 0;
vector<item> items;
while (1)
{
cin>>w;
if (w == -1)
break;
cin>>c;
items.push_back(item(w,c));
}
cout<<"the maximum weight of knapsack : ";
cin>>maxW;
sort(items.begin(), items.end(), &comparator);
for(auto it = items.begin(); it != items.end(); it++){
if(it->weight > maxW){
profit += (it->costPerItem * maxW);
break;
}
profit += (it->cost);
maxW -= (it->weight);
}
cout<<"The maximum profit we can get is "<<profit;
return 0;
}