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.

解题思路：
2n个数字分成n组，每组2个数字，取每组中较小的数字，求和。要求是得到的和最大，方法返回值即为这个最大和。
设2n个数字升序排序后为：a0，a1，a2，a3，….，a(2n-1)。
猜想一下容易发现，最大和即为 (a0+a2+a4+….+a(2n-2))，最小和即为(a0+a1+a2+…+a(n-1))。

class Solution(object):
    def arrayPairSum(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """

        return sum(sorted(nums)[::2])