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
ginger_granger:
20210119 03:42:17
Can anyone explain the problem statement? I dont understand the meaning of first line of input. 

devraj4522:
20201117 11:52:21
The code is right but everytime I am getting wrong answer


aditigedam:
20200824 16:29:22
we have to find max sum of sum of the hotness bonds for all pairs that MMDS has proposed. 

gokulan_cv:
20200708 08:54:48
Just Sort The list and do the corresponding operations. 

shrimp_bisque:
20200704 15:17:46
This problem LIES. MMDS is a bum that has NOT done its job. Unlike the problem claims, you have to REDO the job of MMDS in addition to whatever else you would do. 

bhavesh2712:
20200525 06:01:37
AC in first go!!!


onkarj:
20200517 10:51:43
MMDS has not done its job. You have to match pairs before computing sum of hotness bonds. 

divyansh_09:
20200512 00:32:18
AC in one Go! 

pradeep_7:
20200501 13:45:07
Hint :


codex_elldrago:
20200416 18:40:40
Questions is to find the maximum sum.

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 