You are given a $0$ indexed integer array nums and an integer k.

In one operation, you can remove one occurrence of the smallest element from nums.

Return the minimum number of operations required so that every element in nums is greater than or equal to k.

Constraints:

• $1 \leq$ nums.length $\leq 50$

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

• $1 \leq$ k $\leq 10^9$

• The input is generated such that there is at least one index i such that nums[i] $\geq$ k.

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.