561. Array Partition I

Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) 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].

1. All the integers in the array will be in the range of [-10000, 10000].

题意：

一个含有2n个数的数组，分成n组，每组两个数，使得min(ai,bi)的和最大，求最大值。

思路：

贪心。在含有最小数的那组里，因为无论取别的什么数，它们之间的最小值还是最小的那个数，所以就取次小的那个，使得剩余部分尽可能大。

代码:

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