To minimize the length of the array, we should maximize the number of operations performed.
提示 2
To perform k operations, it is optimal to use the smallest k values and the largest k values in nums.
提示 3
What is the best way to make pairs from the smallest k values and the largest k values so it is possible to remove all the pairs?
提示 4
If we consider the smallest k values and the largest k values as two separate sorted 0-indexed arrays, a and b, It is optimal to pair a[i] and b[i]. So, a k is valid if a[i] < b[i] for all i in the range [0, k - 1].
提示 5
The greatest possible valid k can be found using binary search.
