[binary search - simple] LCP 18 Breakfast combination

subject
Be careful ： The answer needs to be 1e9 + 7 (1000000007) Take the mold for the bottom , Such as ： The initial result of calculation is ：1000000008, Please return 1
Tips ：

1 <= staple.length <= 10^5
1 <= drinks.length <= 10^5
1 <= staple[i],drinks[i] <= 10^5
1 <= x <= 2*10^5

【 Code 】
Execution time ：1064 ms, In all Python3 Defeated in submission 11.97% Users of
Memory consumption ：28.6 MB, In all Python3 Defeated in submission 96.95% Users of
Pass the test case ：65 / 65

class Solution:
    def breakfastNumber(self, staple: List[int], drinks: List[int], x: int) -> int:
        ans=0
        staple.sort()
        drinks.sort()
        for item in staple:
            # seek drinks Center left to right   The first one is greater than >x-item Of   Numeric subscript 
            if x-item<=0:
                continue
            left,right=0,len(drinks)-1
            while left<=right:
                mid=left+(right-left)//2
                if drinks[mid]<=(x-item):
                    left=mid+1
                else:
                    right=mid-1
            ans+=left
        return ans%(10**9 + 7 )