intcmp(constvoid* a,constvoid*b){return*(int*)a -*(int*)b;}intarrayPairSum(int* nums,int numsSize){int i, ans =0;qsort(nums, numsSize,sizeof(int), cmp);for(i =0; i < numsSize; i +=2){
ans += nums[i];}return ans;}
4. 救生艇
intcmp(constvoid*a,constvoid*b){return*(int*)a -*(int*)b;}intnumRescueBoats(int* people,int peopleSize,int limit){int i;int l =0, r = peopleSize-1;int ans =0;qsort(people, peopleSize,sizeof(int), cmp);while(l <= r){if(l == r){++ans;break;}elseif(people[l]+ people[r]> limit){++ans, r--;}else++ans,++l,--r;}return ans;}