#274 · #2300 · Successful Pairs of Spells and Potions(咒语和药水的成功对数)

You are given two positive integer arrays spells and potions, and an integer success. A spell and a potion form a successful pair if their product is at least success. Return an array where pairs[i] is the number of potions that form a successful pair with spells[i]. Constraints: 1 <= n, m <= 10^5, 1 <= spells[i], potions[i] <= 10^5, 1 <= success <= 10^10.