题目描述:
给定长度为 2n 的整数数组 nums ,你的任务是将这些数分成 n 对, 例如 (a1, b1), (a2, b2), …, (an, bn) ,使得从 1 到 n 的 min(ai, bi) 总和最大。
返回该 最大总和 。
示例:
**输入:**nums = [1,4,3,2]
**输出:**4
**解释:**所有可能的分法(忽略元素顺序)为:
- (1, 4), (2, 3) -> min(1, 4) + min(2, 3) = 1 + 2 = 3
- (1, 3), (2, 4) -> min(1, 3) + min(2, 4) = 1 + 2 = 3
- (1, 2), (3, 4) -> min(1, 2) + min(3, 4) = 1 + 3 = 4
所以最大总和为 4输入:nums = [6,2,6,5,1,2]
**输出:**9
**解释:**最优的分法为 (2, 1), (2, 5), (6, 6). min(2, 1) + min(2, 5) + min(6, 6) = 1 + 2 + 6 = 9
class Solution {
public:
int arrayPairSum(vector<int>& nums) {
QuickSort(nums, 0, nums.size()-1);
int res = 0;
for(int i=0; i<nums.size(); i=i+2)
res += nums[i];
return res;
}
void QuickSort(vector<int>& a, int low ,int high){
if(low < high){
int pivotpos = Partition(a, low, high);
QuickSort(a, low, pivotpos-1);
QuickSort(a, pivotpos + 1, high);
}
}
int Partition(vector<int>& a, int low, int high){
int pivot = a[low];
while(low < high){
while(low < high && a[high] >= pivot) --high;
a[low] = a[high];
while(low < high && a[low] <= pivot) ++low;
a[high] = a[low];
};
a[low] = pivot;
return low;
}
};