<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>

class Solution:
    def shortestSubarray(self, nums: List[int], k: int) -> int:
        total=0
        left=0
        right=0
        count=inf
        heap=[]

        for i in range(len(nums)):
            total+=nums[i]
            # print("total: ",total)
            if total<=0:
                total=0
                left=right=i+1
                heap=[]
            elif total>0:
                right+=1
                heappush(heap,(total,i+1))
                if total >=k:
                    temp_total=total
                    heap_ele=[]
                    while(temp_total>=k):
                        
                        if len(heap_ele):
                            heappop(heap)
                            left=heap_ele[1]
                            # total-=heap_ele[0]
                        temp_total=total
                            
                        # print("temp_total: ",temp_total)
                        # if count<right-left:
                        #     count=right-left
                        count=min(count,right-left)
                        # temp_total=total
                        heap_ele=heap[0]
                        if heap_ele[1]>left:
                            temp_total-=heap_ele[0]
        if count==inf:
            return -1
        else:
            return count
                    


        
                

33200