leetcode 数组拆分

Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum of min(ai, bi) for all i is maximized. Return the maximized sum.

func arrayPairSum(nums []int) int {
    sort.Ints(nums)
    var res int
    for i:=0;i<len(nums);i=i+2{
    	 res +=nums[i]
	}
	return res
}