leetCode---Array Partition I

一. 题目：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.

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].

二. 思路分析

首先我们对数组排序，然后把数组的奇数位加起来即为所求。代码如下：

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