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
Verma Rahul Omprakash:
20140612 19:43:03
Who so ever has framed the question should clarify that the sum has to be maximized.... 

Krish:
20140520 11:54:17
Provide TestCase please 

Krish:
20140520 11:52:38
I got Wrong Answer....... Please Provide Some TestCases


pvkcse:
20140518 07:29:26
just a curly brace in the wrong place costs me ten submissions...finally got Green...!!! 

Robin Kumar:
20140502 06:26:08
The problem statement is ambiguous. There is something extra u need to do apart from what is being asked to get AC :) 

Kishlay Raj:
20140419 21:12:29
how is it possible to solve it in 0.0 , did they do it without sorting 

CRACKER:
20140327 19:25:45
very easy.. got ac in first attempt..:) 

Aadithya U:
20140324 13:20:27
got AC in one go.. :) thanks to the comments.. for pointing that the sum has to be maximum :) 

joud zouzou:
20140219 18:31:04
@ mallipeddi akshay


ThunderStorm:
20140109 10:42:12
should we find the maximum

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 