FASHION  Fashion Shows
A fashion show rates participants according to their level of hotness. Two different fashion shows were organized, one for men and the other for women. A date for the third is yet to be decided ;) .
Now the results of both fashion shows are out. The participants of both the fashion shows have decided to date each other, but as usual they have difficuly in choosing their partners. The Maximum Match dating serive (MMDS) comes to their rescue and matches them in such a way that that maximizes the hotness bonds for all couples.
If a man has been rated at hotness level x and a women at hotness level y, the value of their hotness bond is x*y.
Both fashion shows contain N participants each. MMDS has done its job and your job is to find the sum of hotness bonds for all the couples that MMDS has proposed.
Input
The first line of the input contains an integer t, the number of test cases. t test cases follow.
Each test case consists of 3 lines:
 The first line contains a single integer N (1 <= N <= 1000).
 The second line contains N integers separated by single spaces denoting the hotness levels of the men.
 The third line contains N integers separated by single spaces denoting the hotness levels of the women.
All hotness ratings are on a scale of 0 to 10.
Output
For each test case output a single line containing a single integer denoting the sum of the hotness bonds for all pairs that MMDS has proposed.
Example
Input: 2 2 1 1 3 2 3 2 3 2 1 3 2 Output: 5 15
hide comments
mr_nikhil:
20230903 02:17:45
Many People asking, why sorting is needed in this question?


flower:
20230722 08:48:12
Poor problem statement. "Given two lists of N numbers each, what is the maximum that can be attained by multiplying them pairwise one from each, and adding them?" 

bairu_nagaraju:
20230507 07:29:48
in question it was clear that max rated people can date together


cmrtc5q3:
20230506 11:25:23
Can anyone tell me why ppl used sorting here?


aditya_cs21:
20221225 11:58:51
why sorting is needed


jsuryasuba:
20220701 03:32:42
Anyone please explain, I used Arrays.sort() in java to sort the array. When I used merge sort, I got TLE, where as when I used merge sort the code got accepted. How it happens? Time complexity of merge sort is always <= timecomplexity of quick sort, right? 

gaurav_saran:
20220326 19:30:28
They fort to mention MAX SUM lol , AC on 2nd go 

dwijitha_124:
20211227 12:54:15
why sorting is needed in this problem 

sabkx:
20210912 06:08:58
why did i get NZEC 

rchtchauhan:
20210827 10:34:41
I am getting runtime error

Added by:  Matthew Reeder 
Date:  20061029 
Time limit:  1s 
Source limit:  30000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  AlKhawarizm 2006 