You are given two $0$ indexed integer arrays nums and cost, both of length n.

In one operation, you can increase or decrease any element nums[i] by $1$. The cost of performing this operation on nums[i] is cost[i].

Return the minimum total cost to make all elements in nums equal.

Constraints:

• n $==$ nums.length $==$ cost.length

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ nums[i], cost[i] $\leq 10^6$

• The test cases are generated such that the minimum cost does not exceed $2^{53} - 1$

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.