如果产品小于给定数量，则需要更快的算法来计算

I have the next problem: My program reads two arrays and multiplies each element of the first array with each of the 2nd array. I have to count the number of results smaller than a given number. My code works correctly but i need to find a faster algorithm.I have the next problem: My program reads two a