You are given an integer array nums and a positive integer k.

In a single operation, you can increment or decrement any element of nums by $1$.

Return the minimum number of operations required to make the median of nums equal to k.

Note: The median of an array is defined as the middle element after sorting the array in nondecreasing order. If the array contains an even number of elements, the median is the element located at index $\lfloor \frac{ ext{`nums.length`}}{2} \rfloor$ using $0$ indexing.

Constraints:

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

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

• $1 \leq$ k $\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.