用二分做这个题目，$O(n * log(n))$ 为毛被卡了，是Python太慢了吗

Python代码

def find(tmpArr, k, l): # k是要查找的数据 l是数组长度
    i = 0
    j = l - 1
    while i <= j:
        mid = int((i + j) / 2)
        if (arr[mid] > k):
            i = mid + 1
        else:
            j = mid - 1
    ansL = i
    i = 0
    j = l - 1
    while i <= j:
        mid = int((i + j) / 2)
        if (arr[mid] >= k):
            i = mid + 1
        else:
            j = mid - 1
    ansR = j
    return ansR - (ansL - 1)


ans = 0
n, c = map(int, input().split(" "))
arr = list(map(int, input().split(" ")))
arr.sort(reverse=True)  # 二分前对数组排序
for i in range(0, n):
    key = arr[i] - c
    ans = ans + find(arr, key, n)
print(ans)