Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum of min(ai, bi) for all i is maximised.
Return the maximised sum.
1 <= n <= 10^4nums.length == 2 * n-10^4 <= nums[i] <= 10^4nums = [1,4,3,2]4nums = [6,2,6,5,1,2]9