力扣二分查找：统计和小于目标的下标对数目

int countPairs(int* nums, int numsSize, int target){
    int i,j;
    int cmp(const void*n1,const void*n2){
        return *(int*)n1-*(int*)n2;
    }
    qsort(nums,numsSize,sizeof(int),cmp);
    int sum=0;
    for(i=0;i<numsSize-1;i++){
        int first=i+1,last=numsSize-1;
        int res=0;
        while(first<=last){
            j=first+(last-first)/2;
            if(nums[i]+nums[j]<target){
                res=j-i;
                first=j+1;
            }
            else last=j-1;
        }
        sum+=res;
    }
    return sum;
}