given two arrays of integers of the same length, pair the numbers one by one, calculate the product of each pair of numbers, then sum, calculate the pairing mode with the smallest sum, and print the sum.
input example:
[1jue 2jue 3], [1Jing 2jue 3]
output example:
10