add 1833

fishercoder1534 · fishercoder1534 · commit d2002f9e7058 · 2021-04-18T08:15:21.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1833|[Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1833.java) ||Medium|Array, Sort|
 |1832|[Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1832.java) ||Easy|String|
 |1829|[Maximum XOR for Each Query](https://leetcode.com/problems/maximum-xor-for-each-query/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1829.java) ||Medium|Bit Manipulation|
 |1828|[Queries on Number of Points Inside a Circle](https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1828.java) ||Medium|Math|
diff --git a/src/main/java/com/fishercoder/solutions/_1833.java b/src/main/java/com/fishercoder/solutions/_1833.java
@@ -0,0 +1,28 @@
+package com.fishercoder.solutions;
+
+import java.util.TreeMap;
+
+public class _1833 {
+    public static class Solution1 {
+        public int maxIceCream(int[] costs, int coins) {
+            TreeMap<Integer, Integer> treeMap = new TreeMap<>();
+            for (int cost : costs) {
+                treeMap.put(cost, treeMap.getOrDefault(cost, 0) + 1);
+            }
+            int maxIceCream = 0;
+            for (int cost : treeMap.keySet()) {
+                if (cost * treeMap.get(cost) <= coins) {
+                    maxIceCream += treeMap.get(cost);
+                    coins -= cost * treeMap.get(cost);
+                } else {
+                    while (coins > 0 && coins - cost >= 0) {
+                        coins -= cost;
+                        maxIceCream++;
+                    }
+                    break;
+                }
+            }
+            return maxIceCream;
+        }
+    }
+}
