3107. Minimum Operations to Make Median of Array Equal to K LeetCode Solution

In this guide, you will get 3107. Minimum Operations to Make Median of Array Equal to K LeetCode Solution with the best time and space complexity. The solution to Minimum Operations to Make Median of Array Equal to K problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Table of Contents

1. Problem Statement
2. Complexity Analysis
3. Minimum Operations to Make Median of Array Equal to K solution in C++
4. Minimum Operations to Make Median of Array Equal to K solution in Java
5. Minimum Operations to Make Median of Array Equal to K solution in Python
6. Additional Resources

Problem Statement of Minimum Operations to Make Median of Array Equal to K

You are given an integer array nums and a non-negative integer k. In one operation, you can increase or decrease any element by 1.
Return the minimum number of operations needed to make the median of nums equal to k.
The median of an array is defined as the middle element of the array when it is sorted in non-decreasing order. If there are two choices for a median, the larger of the two values is taken.

Example 1:

Input: nums = [2,5,6,8,5], k = 4
Output: 2
Explanation:
We can subtract one from nums[1] and nums[4] to obtain [2, 4, 6, 8, 4]. The median of the resulting array is equal to k.

Example 2:

Input: nums = [2,5,6,8,5], k = 7
Output: 3
Explanation:
We can add one to nums[1] twice and add one to nums[2] once to obtain [2, 7, 7, 8, 5].

Example 3:

Input: nums = [1,2,3,4,5,6], k = 4
Output: 0
Explanation:
The median of the array is already equal to k.

Constraints:

1 <= nums.length <= 2 * 105
1 <= nums[i] <= 109
1 <= k <= 109

Complexity Analysis

• Time Complexity: O(\texttt{sort})
• Space Complexity: O(\texttt{sort})

3107. Minimum Operations to Make Median of Array Equal to K LeetCode Solution in C++

class Solution {
 public:
  long long minOperationsToMakeMedianK(vector<int>& nums, int k) {
    const int n = nums.size();
    long ans = 0;

    ranges::sort(nums);

    for (int i = 0; i <= n / 2; ++i)
      ans += max(0, nums[i] - k);

    for (int i = n / 2; i < n; ++i)
      ans += max(0, k - nums[i]);

    return ans;
  }
};
/* code provided by PROGIEZ */

3107. Minimum Operations to Make Median of Array Equal to K LeetCode Solution in Java

class Solution {
  public long minOperationsToMakeMedianK(int[] nums, int k) {
    final int n = nums.length;
    long ans = 0;

    Arrays.sort(nums);

    for (int i = 0; i <= n / 2; ++i)
      ans += Math.max(0, nums[i] - k);

    for (int i = n / 2; i < n; ++i)
      ans += Math.max(0, k - nums[i]);

    return ans;
  }
}
// code provided by PROGIEZ

3107. Minimum Operations to Make Median of Array Equal to K LeetCode Solution in Python

class Solution:
  def minOperationsToMakeMedianK(self, nums: list[int], k: int) -> int:
    n = len(nums)
    ans = 0

    nums.sort()

    for i in range(n // 2 + 1):
      ans += max(0, nums[i] - k)

    for i in range(n // 2, n):
      ans += max(0, k - nums[i])

    return ans
 # code by PROGIEZ

Additional Resources

• Explore all LeetCode problem solutions at Progiez here
• Explore all problems on LeetCode website here

Happy Coding! Keep following PROGIEZ for more updates and solutions.