Skip to content

3107. Minimum Operations to Make Median of Array Equal to K 👎

  • Time: $O(\texttt{sort})$
  • Space: $O(\texttt{sort})$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
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;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
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;
  }
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
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