Python3 Binary Search And Sort
\nclass Solution:\n    def sumOfFlooredPairs(self, nums):\n        counter = Counter(nums)\n        nums.sort()\n        res = 0\n        for n, c in counter.it
```\nclass Solution:\n    def sumOfFlooredPairs(self, nums):\n        counter = Counter(nums)\n        nums.sort()\n        res = 0\n        for n, c in counter.items():\n            multiplier, idx, last_idx = 1, -1, 1\n            while idx < len(nums):\n                idx = bisect.bisect_left(nums, n*multiplier)\n                res += (idx - last_idx) * (multiplier-1) * c\n                multiplier += 1\n                last_idx = idx\n                \n        return res % 1_000_000_007\n```
[]