From 01db23d426a2c1010d2104fde09e4502730d81ec Mon Sep 17 00:00:00 2001
From: Hao Chen <haoel@hotmail.com>
Date: Tue, 20 Apr 2021 18:24:01 +0800
Subject: [PATCH] New Problem Solution - "1833. Maximum Ice Cream Bars"

---
 README.md                                     |  1 +
 .../MaximumIceCreamBars.cpp                   | 55 +++++++++++++++++++
 2 files changed, 56 insertions(+)
 create mode 100644 algorithms/cpp/maximumIceCreamBars/MaximumIceCreamBars.cpp

diff --git a/README.md b/README.md
index 63ee03282..f42f97d33 100644
--- a/README.md
+++ b/README.md
@@ -9,6 +9,7 @@ LeetCode
 
 | # | Title | Solution | Difficulty |
 |---| ----- | -------- | ---------- |
+|1833|[Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars/) | [C++](./algorithms/cpp/maximumIceCreamBars/MaximumIceCreamBars.cpp)|Medium|
 |1832|[Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/) | [C++](./algorithms/cpp/checkIfTheSentenceIsPangram/CheckIfTheSentenceIsPangram.cpp)|Easy|
 |1829|[Maximum XOR for Each Query](https://leetcode.com/problems/maximum-xor-for-each-query/) | [C++](./algorithms/cpp/maximumXorForEachQuery/MaximumXorForEachQuery.cpp)|Medium|
 |1828|[Queries on Number of Points Inside a Circle](https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/) | [C++](./algorithms/cpp/queriesOnNumberOfPointsInsideACircle/QueriesOnNumberOfPointsInsideACircle.cpp)|Medium|
diff --git a/algorithms/cpp/maximumIceCreamBars/MaximumIceCreamBars.cpp b/algorithms/cpp/maximumIceCreamBars/MaximumIceCreamBars.cpp
new file mode 100644
index 000000000..659da1a52
--- /dev/null
+++ b/algorithms/cpp/maximumIceCreamBars/MaximumIceCreamBars.cpp
@@ -0,0 +1,55 @@
+// Source : https://leetcode.com/problems/maximum-ice-cream-bars/
+// Author : Hao Chen
+// Date   : 2021-04-20
+
+/***************************************************************************************************** 
+ *
+ * It is a sweltering summer day, and a boy wants to buy some ice cream bars.
+ * 
+ * At the store, there are n ice cream bars. You are given an array costs of length n, where costs[i] 
+ * is the price of the i^th ice cream bar in coins. The boy initially has coins coins to spend, and he 
+ * wants to buy as many ice cream bars as possible. 
+ * 
+ * Return the maximum number of ice cream bars the boy can buy with coins coins.
+ * 
+ * Note: The boy can buy the ice cream bars in any order.
+ * 
+ * Example 1:
+ * 
+ * Input: costs = [1,3,2,4,1], coins = 7
+ * Output: 4
+ * Explanation: The boy can buy ice cream bars at indices 0,1,2,4 for a total price of 1 + 3 + 2 + 1 = 
+ * 7.
+ * 
+ * Example 2:
+ * 
+ * Input: costs = [10,6,8,7,7,8], coins = 5
+ * Output: 0
+ * Explanation: The boy cannot afford any of the ice cream bars.
+ * 
+ * Example 3:
+ * 
+ * Input: costs = [1,6,3,1,2,5], coins = 20
+ * Output: 6
+ * Explanation: The boy can buy all the ice cream bars for a total price of 1 + 6 + 3 + 1 + 2 + 5 = 18.
+ * 
+ * Constraints:
+ * 
+ * 	costs.length == n
+ * 	1 <= n <= 10^5
+ * 	1 <= costs[i] <= 10^5
+ * 	1 <= coins <= 10^8
+ ******************************************************************************************************/
+
+class Solution {
+public:
+    int maxIceCream(vector<int>& costs, int coins) {
+        sort(costs.begin(), costs.end());
+        int cnt = 0;
+        for(int i=0; i<costs.size() && costs[i] <= coins; i++) {
+            cnt++;
+            coins -= costs[i];
+        }
+        return cnt;
+    }
+};