561. Array Partition I

题意理解：组成数组对，使得所有数组对中最小值的和最大

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