Please solve the programming task below using a self-contained code snippet in a markdown code block.

You are given two 0-indexed arrays nums and cost consisting each of n positive integers.
You can do the following operation any number of times:

Increase or decrease any element of the array nums by 1.

The cost of doing one operation on the ith element is cost[i].
Return the minimum total cost such that all the elements of the array nums become equal.
 
Please complete the following python code precisely:
```python
class Solution:
    def minCost(self, nums: List[int], cost: List[int]) -> int:
```