Time: 98 ms (11.40%), Space: 57.6 MB (88.36%) - LeetHub

py3-coder · py3-coder · commit e249f1bc2080 · 2024-11-17T23:45:47.000+05:30
diff --git a/0862-shortest-subarray-with-sum-at-least-k/0862-shortest-subarray-with-sum-at-least-k.java b/0862-shortest-subarray-with-sum-at-least-k/0862-shortest-subarray-with-sum-at-least-k.java
@@ -0,0 +1,35 @@
+class Solution {
+    public int shortestSubarray(int[] nums, int k) {
+        int ans = Integer.MAX_VALUE;
+        long Csum=0;
+        
+        PriorityQueue<Pair> pq = new PriorityQueue<Pair>(
+                (a, b) -> Long.compare(a.sum, b.sum)
+        );
+
+        for(int i=0;i<nums.length;i++){
+            Csum += nums[i];
+             
+            if(Csum>=k){
+                ans = Math.min(ans , i+1);
+            }
+            while(!pq.isEmpty() && Csum-pq.peek().sum >=k){
+                Pair pp = pq.poll();
+                ans = Math.min(ans , i-pp.indx);
+            }
+            
+            pq.offer(new Pair(Csum , i));
+        }
+        return ans == Integer.MAX_VALUE ? -1 : ans;
+        
+    }
+    public class Pair{
+        long sum ;
+        int indx;
+        
+        Pair(long _sum,int _indx){
+            this.sum =_sum;
+            this.indx= _indx;
+        }
+    }
+}
