Merge pull request #783 from frostop1/sd3

Created Solution program to find maximum number of stocks that  can be bought with given constraints.

Advanced data structures/Maximum Stocks.cpp

@@ -0,0 +1,41 @@
+// C++ program to find maximum number of stocks that
+// can be bought with given constraints.
+#include <bits/stdc++.h>
+using namespace std;
+
+// Return the maximum stocks
+int buyMaximumProducts(int n, int k, int price[])
+{
+	vector<pair<int, int> > v;
+
+	// Making pair of product cost and number
+	// of day..
+	for (int i = 0; i < n; ++i)
+		v.push_back(make_pair(price[i], i + 1));
+
+	// Sorting the vector pair.
+	sort(v.begin(), v.end());
+
+	// Calculating the maximum number of stock
+	// count.
+	int ans = 0;
+	for (int i = 0; i < n; ++i) {
+		ans += min(v[i].second, k / v[i].first);
+		k -= v[i].first * min(v[i].second,
+							(k / v[i].first));
+	}
+
+	return ans;
+}
+
+// Driven Program
+int main()
+{
+	int price[] = { 10, 7, 19 };
+	int n = sizeof(price)/sizeof(price[0]);
+	int k = 45;
+
+	cout << buyMaximumProducts(n, k, price) << endl;
+
+	return 0;
+}