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
get_right_jr:
20160607 14:41:21
the EASIEST problem I've ever solved!!! 

code0monkey1:
20160606 23:52:15
Apparently the Maximum Match dating serive (MMDS) has not done it's job properly , so you need to sort them according to hotness yourself 

manish3749:
20160523 11:54:24
just cozz this prblm is related to hot models, u will put it into classic, dude its the easiest tht i have ever solved in spoj 

sayedathar11:
20160505 17:57:57
apart for sorting arrays pay careful attention to constraints of array size got 2 wa's because of that :) 

shirish_heller:
20160503 08:49:03
but its written that MMDS has done its job...i should not sort arrays then..rt?


rayhan50001:
20160428 21:47:08
simple problem... AC in 1st Go 

Christian López:
20160419 20:36:27
Mi solución número 20. Last edit: 20160419 20:36:50 

starun8795:
20160415 11:38:58
getting internal error at the time of submission


gautam:
20160403 14:09:39
too easy..ac in one go ;) 

adi_tdkr:
20160403 08:52:22
Sort the array first and then multiply corresponding numbers

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 