2616-minimize-the-maximum-difference-of-pairs.py

from typing import List


class Solution:
    def minimizeMax(self, nums: List[int], p: int) -> int:
        nums.sort()
        n = len(nums)

        def countValidPairs(thresold):
            index, count = 0,0
            while index < n-1:
                if nums[index + 1] - nums[index] <= thresold:
                    count += 1
                    index += 1
                index += 1
            return count
        
        left,right = 0, nums[-1] - nums[0]
        while left < right:
            mid = left + (right - left) // 2
            if countValidPairs(mid) >= p:
                right = mid
            else:
                left = mid + 1
            
        return left