You are given an integer array nums. In one move, you may increase the value of any single element nums[i] by 1. Return the minimum total number of moves required so that all elements in nums become equal.   Example 1: Input: nums = [2,1,3] Output: 3 Explanation:…

给你一个整数数组 nums 和两个整数 x 和 k。你可以执行以下操作任意次（包括零次）：

You are given an integer array nums and two integers, x and k. You can perform the following operation any number of times (including zero):