You are given two $0$ indexed integer arrays nums1 and nums2 of the same length, along with an integer x.

In each second, you perform the following steps:

1. For every index i, the value of nums1[i] is incremented by nums2[i].

2. After the increment, you can select at most one index i and set nums1[i] to $0$.

Return the minimum number of seconds needed to make the sum of all elements in nums1 less than or equal to x. If it is impossible to do so, return $-1$.

Constraints:

• $1 \leq$ nums1.length $\leq 10^3$

• $1 \leq$ nums1[i] $\leq 10^3$

• $0 \leq$ nums2[i] $\leq 10^3$

• nums1.length $==$ nums2.length

• $0 \leq$ x $\leq 10^6$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.