Create Maximum Bags With Full Capacity of Rocks.java

varunu28 · web-flow · commit d8777ec40575 · 2022-05-22T14:30:34.000-07:00
diff --git a/Medium/Maximum Bags With Full Capacity of Rocks.java b/Medium/Maximum Bags With Full Capacity of Rocks.java
@@ -0,0 +1,15 @@
+class Solution {
+  public int maximumBags(int[] capacity, int[] rocks, int additionalRocks) {
+    PriorityQueue<Integer> pq = new PriorityQueue<>();
+    for (int i = 0; i < capacity.length; i++) {
+      pq.add(capacity[i] - rocks[i]);
+    }
+    while (!pq.isEmpty()) {
+      if (pq.peek() > additionalRocks) {
+        return capacity.length - pq.size();
+      }
+      additionalRocks -= pq.poll();
+    }
+    return capacity.length;
+  }
+}
