You are given two positive integer arrays`spells` and`potions`, of length`n` and`m` respectively, where`spells[i]` represents the strength of the i^th spell and`potions[j]` represents the strength of the j^th potion.

You are also given an integer`success`. A spell and potion pair is considered**successful** if the**product** of their strengths is**at least** success.

Return an integer array`pairs` of length`n` where`pairs[i]` is the number of**potions** that will form a successful pair with the i^th spell.

**Example 1:**

**Example 2:**

Successful Pairs of Spells and Potions

package Solution

funcSolution(xbool)bool {

funcSolution(spells []int,potions []int,successint64) []int {

ans:=make([]int,len(spells))

sort.Ints(potions)

fori,n:=rangespells {

for ;idx<len(potions);idx++ {

ifint64(potions[idx])*int64(n)>=success {

}

}

ans[i]=len(potions)-idx

}

}

funcTestSolution(t*testing.T) {

cases:= []struct {

s,p []int

expect []int

}{

{"TestCase",true,true},

{"TestCase",true,true},

{"TestCase",false,false},

{"TestCase1", []int{5,1,3}, []int{1,2,3,4,5},7, []int{4,0,3}},

{"TestCase2", []int{3,1,2}, []int{8,5,8},16, []int{2,0,2}},

}

fori,c:=rangecases {

t.Run(c.name+" "+strconv.Itoa(i),func(t*testing.T) {

got:=Solution(c.inputs)

got:=Solution(c.s,c.p,c.success)

if!reflect.DeepEqual(got,c.expect) {

t.Fatalf("expected: %v, but got: %v, with inputs: %v",

c.expect,got,c.inputs)

t.Fatalf("expected: %v, but got: %v, with inputs: %v %v %v",

c.expect,got,c.s,c.p,c.success)

}

})

}

}

funcBenchmarkSolution(b*testing.B) {

}

funcExampleSolution() {

}