Minimize Maximum Pair Sum in Array
The pair sum of a pair (a, b) is equal to a + b. The maximum pair sum is the largest pair sum in a list of pairs.
Given an array nums of even length n, pair up the elements of nums into n / 2 pairs such that:
- Each element of
numsis in exactly one pair. - The maximum pair sum is minimized.
Return the minimized maximum pair sum after optimally pairing up the elements.
Example 1
Input
nums = [3,5,2,3]Output
7The elements can be paired into (3, 3) and (5, 2), making the maximum pair sum max(6, 7) = 7.
Example 2
Input
nums = [3,5,4,2,4,6]Output
8The elements can be paired into (3, 5), (4, 4), and (6, 2), making every pair sum equal to 8.
Constraints
- n == nums.length
- 2 <= n <= 10^5
- n is even.
- 1 <= nums[i] <= 10^5