Time: 92 ms (10.76%), Space: 88.9 MB (87.34%) - LeetHub

Author: Sangram03

3647-zero-array-transformation-iii/3647-zero-array-transformation-iii.java

@@ -0,0 +1,23 @@
+class Solution {
+    public int maxRemoval(int[] nums, int[][] queries) {
+        Arrays.sort(queries, (a, b) -> Integer.compare(a[0], b[0]));
+        PriorityQueue<Integer> available = new PriorityQueue<>(Collections.reverseOrder());
+        PriorityQueue<Integer> assigned = new PriorityQueue<>();
+        int count = 0;
+        for (int time = 0, k = 0; time < nums.length; time++) {
+            while (!assigned.isEmpty() && assigned.peek() < time)
+                assigned.poll();
+            while (k < queries.length && queries[k][0] <= time)
+                available.add(queries[k++][1]);
+            while (assigned.size() < nums[time]
+                   && !available.isEmpty()
+                   && available.peek() >= time) {
+                assigned.add(available.poll());
+                count++;
+            }
+            if (assigned.size() < nums[time])
+                return -1;
+        }
+        return queries.length - count;
+    }
+}