We have two arrays of integer with n elements ( n <= 10^5 ) , consider:
a1 a2 a3 ... an
b1 b2 b3 ... bn
( abs(a[i],b[i]) <= 10^9 )
print maximum first k element c=(a[i] * b[j]) ( 1<=i,j<=n)
For example: input: n=3 k=3
a={1,2,3}
b={4,5,6}
Correct output: 6 12 18
I'm trying to solve problem like this , but i don't have any idea for getting "AC" , so i need some helps , thank everybody.