intcmp(int*a,int*b){return*a -*b;}intarrayPairSum(int*nums,int numsSize){qsort(nums, numsSize,sizeof(int), cmp);int ans =0;for(int i =0; i < numsSize; i +=2){
ans += nums[i];}return ans;}
LeetCode 561. 数组拆分Ⅰ-C语言题目描述解题思路代码int cmp(int *a, int *b) { return *a - *b;}int arrayPairSum(int *nums, int numsSize) { qsort(nums, numsSize, sizeof(int), cmp); int ans = 0; for (int i = 0; i < numsSize; i += 2) { ans += nu