From c931d9d3bbc7cb11327fcde12abcb585e7bb34a5 Mon Sep 17 00:00:00 2001
From: Deblina Talukdar <deblina7talukdar@gmail.com>
Date: Wed, 30 Oct 2019 23:20:45 +0530
Subject: [PATCH] Create greedy-knapsack_deblina-talukdar.cpp

create the greedy version of knapsack problem.
---
 .../greedy-knapsack_deblina-talukdar.cpp      | 43 +++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 Data structures and Algorithms/greedy-knapsack_deblina-talukdar.cpp

diff --git a/Data structures and Algorithms/greedy-knapsack_deblina-talukdar.cpp b/Data structures and Algorithms/greedy-knapsack_deblina-talukdar.cpp
new file mode 100644
index 0000000..aba1d55
--- /dev/null
+++ b/Data structures and Algorithms/greedy-knapsack_deblina-talukdar.cpp	
@@ -0,0 +1,43 @@
+#include<bits/stdc++.h>
+using namespace std;
+#define ll long long
+#define PI 3.14159265
+#define pb push_back
+#define pf push_front
+#define mp make_pair
+#define fs first
+#define sc second
+const ll mod=1e9+7;
+const ll siz=5*1e5+5;
+bool sortinrev(const pair<float,int> &a, const pair<float,int> &b){ 
+       return (a.first > b.first); 
+}
+int main(){
+	int n,i,W,w[siz],v1[siz];
+	float s=0.0;
+	vector<pair<float,int>>v;
+	//getting the number of items in knapsack
+	cin>>n;
+	for(i=0;i<n;i++){
+		cin>>w[i]>>v1[i];
+		v.pb({(float)((float)v1[i]/(float)w[i]),i});
+	}
+	//getting the total weight
+	cin>>W;
+	//sorting in decreasing order of value/weight
+	sort(v.begin(),v.end(),sortinrev);
+	for(i=0;i<n;i++){
+		if(w[v[i].second]<=W){
+			s+=v1[v[i].second];
+			W-=w[v[i].second];
+		}
+		else{
+			s+=(v[i].first*W);
+			W=0;
+			break;
+		}
+	}
+	//sum of values of all items in the knapsack
+	cout<<s;
+	return 0;
+}