Problem Statement  
Once upon a time, there was a kingdom where math was always a big problem. When the post of the royal treasurer needed to be filled, applicants were presented with the following problem: "We have two arrays of integers, A and B. A and B each contain exactly N elements. Let's define a function S over A and B: S = A_{0}*B_{0} + ? + A_{N1}*B_{N1}Rearrange the numbers in A in such a way that the value of S is as small as possible. You are not allowed to rearrange the numbers in B.? The problem writers need a program to check the correctness of the applicants' answers. Given int[]s A and B, return the smallest possible value for S.  
Definition  
 
Constraints  
  A will contain between 1 and 50 elements, inclusive.  
  A and B will contain the same number of elements.  
  Each element of A will be between 0 and 100, inclusive.  
  Each element of B will be between 0 and 100, inclusive.  
Examples  
0)  
 
1)  
 
2)  
