<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <em>the length of the shortest non-empty <strong>subarray</strong> of </em><code>nums</code><em> with a sum of at least </em><code>k</code>. If there is no such <strong>subarray</strong>, return <code>-1</code>.</p>

<p>A <strong>subarray</strong> is a <strong>contiguous</strong> part of an array.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> nums = [1], k = 1
<strong>Output:</strong> 1
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> nums = [1,2], k = 4
<strong>Output:</strong> -1
</pre><p><strong class="example">Example 3:</strong></p>
<pre><strong>Input:</strong> nums = [2,-1,2], k = 3
<strong>Output:</strong> 3
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>5</sup> &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= k &lt;= 10<sup>9</sup></code></li>
</ul>

from collections import deque
class Solution:
    def shortestSubarray(self, nums: List[int], k: int) -> int:
    
        queue=deque()
        total=0
        res=float('inf')

        for r in range(len(nums)):
            
            total+=nums[r]
            if total>=k:
                
                res=min(res,r+1)
            curr=float('inf')


            

            while queue and total-queue[0][1]>=k:
                curr=r-queue[0][0]
                
                queue.popleft()
            if curr!=float('inf'):
               
                res=min(res,curr)
            while queue and queue[-1][1]>=total:
                queue.pop()

            
            queue.append((r,total))
        return res if res!=float('inf') else -1

31700