【C++】561. Array Partition I

通过这道题学到的新知识：

std::sort可用于对C++ STL容器的排序。

std::sort的声明语法：

template <class RandomAccessIterator>

void sort ( RandomAccessIterator first,RandomAccessIterator last );

template <class RandomAccessIterator,class Compare>

void sort ( RandomAccessIterator first,RandomAccessIterator last, StrictWeakOrdering comp );

在数据量很大时采用正常的快速排序，此时效率为O(logN)。

一旦分段后的数据量小于某个阈值，就改用插入排序，因为此时这个分段是基本有序的，这时效率可达O(N)。

题目：

Pick One

---

Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a₁, b₁), (a₂, b₂), ..., (a_n, b_n) which makes sum of min(a_i, b_i) for all i from 1 to n as large as possible.

Example 1:

Input: [1,4,3,2]

Output: 4
Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).

Note:

1. n is a positive integer, which is in the range of [1, 10000].
2. All the integers in the array will be in the range of [-10000, 10000].

分析：

先将这组数从小到大排序，两两一组，每组的较小数的和最大。即排序后第1，3，...，2n-1个数之和。

解答：

class Solution {
public:
    int arrayPairSum(vector<int>& nums) {
        int sum = 0;
        std::sort(nums.begin(), nums.end());
        for(int i=0; i<nums.size(); i=i+2)
        {
            sum += nums[i];
        }
        return sum;
    }
};