[Python3] 2-line binary search
Please pull this commit for solutions of weekly 308. \n\nIntuition\nFor each query, we always try to use the smallest number availabel for the summation, which 
Please pull this [commit](https://github.com/gaosanyong/leetcode/commit/ea6bc01b091cbf032b9c7ac2d3c09cb4f5cd0d2d) for solutions of weekly 308. \n\n**Intuition**\nFor each query, we always try to use the smallest number availabel for the summation, which results in below binary search implementation. \n\n**Analysis**\nTime complexity `O((M+N)logN)`\nSpace complexity `O(M+N)`\n\n```\nclass Solution: \n    def answerQueries(self, nums: List[int], queries: List[int]) -> List[int]:\n        prefix = list(accumulate(sorted(nums)))\n        return [bisect_right(prefix, q) for q in queries]\n```
['Python3']