You are given an array of positive integers and a threshold t. Find the shortest contiguous subarray whose elements add up to at least t, and report its length. If no contiguous subarray reaches t, report 0.
Input format
Line 1: two integers n and t separated by a space.
Line 2: n space-separated positive integers.
Output format
A single integer: the minimum length of a contiguous subarray with sum ≥ t, or 0 if no such subarray exists.
Constraints
- 1 ≤ n ≤ 100000
- 1 ≤ t ≤ 1000000000
- 1 ≤ each element ≤ 10000
- All elements are strictly positive.