Untitled
Anonymous
plain_text
12/27/2023 6:03 AM
396 B
20
Indexable
s = arr[x] + arr[y]
low = y + 1
high = len(arr) - 1
mid = (low + high) // 2
while low <= high:
if arr[mid] == s:
break
elif arr[mid] < s:
low = mid + 1
else:
high = mid - 1
mid = (low + high) // 2
k += mid - y
if s <= arr[mid]:
k -= 1Editor is loading...
Leave a Comment