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
jaswin kaur:
20150111 21:14:27
AC in one go :)


Gerhardt Funk:
20150106 11:14:05
I think something is wrong with how this problem checks python(2.7) solutions. I rewrote the same code in Java and it was accepted. My initial thought was that I had written something wrong but the py code worked on all the test cases (including VARUN KUMARE's) and I used the same methods of input/output as I had in previous problems Last edit: 20150107 23:16:45 

slim shadyy:
20141219 07:19:10
AC in 1 go!..:) 

kartikay singh:
20141218 09:44:29
AC in 1 gO:)


Swapnil Borse:
20141217 11:07:28
Simple sort and multiply approach.. O(nlogn + n)


asitm9:
20141120 12:46:21
Don't confuse with the word "maximize". 

Pawe³:
20141108 22:18:56
At first I thought there's got to be a hidden logic in x*y  maybe 0 * 5 should be equal to 5, but thankfully not. Adding a sort was enough. Either assume none of the input is correct and validate all or provide a valid input in the first place.


Sarthak Munshi:
20141107 23:34:05
dont forget to sort ! costed me 1 WA 

Gopesh Tulsyan:
20141022 17:16:18
Got accepted in the first go.O(nlogn + n) 

Rishabh Joshi:
20141018 07:22:24
AC in first go! Very easy. 
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 