You will be given two arrays A and B of positive integers. The number of values in both the arrays will be the same say N. Your task is to find the maximum sum of products of their elements. Each element in A has to be multiplied with exactly one element in B and vice versa such that each element of both the arrays appears exactly once and the sum of product produced is maximum.
if A = {5,1,3,4,2} and B = {8,10,9,7,6} then a possible sum of product is 56 + 17 + 39 + 410 + 28.
Example 1:
Input:
N = 3
A[] = {1, 2, 3}
B[] = {4, 5, 1}
Output: 24
Explanation: 53 + 42 + 11 = 24
Example 2:
Input:
N = 2
A[] = {1, 2}
B[] = {4, 4}
Output: 12
Explanation: 42 + 41 = 12
Your Task:
You don't need to read input or print anything. Your task is to complete the function MaxSum() which takes the array A[], B[], and N as inputs and returns the answer.
Expected Time Complexity: O(N * log N)
Expected Auxiliary Space: O(1)
Constraints:
1 ≤ N ≤ 10^{5}
1 ≤ A[i], B[i] ≤ 10^{5}

见题面

见题面