Simple pythonic solution
Code\npython\nclass Solution:\n    def successfulPairs(\n        self, spells: List[int], potions: List[int], success: int\n    ) -> List[int]:\n        n, _ = 
# Code\n```python\nclass Solution:\n    def successfulPairs(\n        self, spells: List[int], potions: List[int], success: int\n    ) -> List[int]:\n        n, _ = len(potions), potions.sort()\n        return [n - bisect_left(potions, success / s) for s in spells]\n```
['Python3']