561. 数组拆分 I - 力扣(LeetCode) (leetcode-cn.com)
class Solution {
public:
static bool cmp(int a, int b){
return a>b;
}
int arrayPairSum(vector<int>& nums) {
sort(nums.begin(),nums.end(),cmp);
int res=0;
for(int i=1;i<nums.size();i+=2){
res+=nums[i];
}
return res;
}
};