You are given an integer array nums and two integers x and y.

In each operation, you can select an index i such that $0 \leq$ i $<$ nums.length and perform the following:

• Decrease nums[i] by x.

• Decrease all other elements in nums by y.

Return the minimum number of operations required to make every value in nums less than or equal to $0$.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^9$

• $1 \leq$ y $<$ x $\leq 10^9$

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.