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
shivam mitra: 2013-12-29 15:59:09

what is the limit for the test cases t?? urgent required

anonymous: 2013-11-09 18:09:19

The phrasing is terrible. Couldn't figure without trial and error whether it is my job to find the best pairing, or it is implied that the best pairing is already given in the input.

Last edit: 2013-11-09 18:10:13
abilash: 2013-08-20 14:58:47

compiles and runs perfectly on code blocks and ideone, but shows wrong answer. any help??

pika_pika: 2013-08-08 18:59:02

python WA, C++ AC but the same logic how... seen this first time.. :(

Ranjan Kumar Singh: 2013-07-21 06:57:30

SPOJ has not clarified the question.....actually the sum has to be maximized nd it will be accepted.....but whoever made this question is foolish....

Dragan MarkoviƦ: 2013-06-21 18:22:29

You need hotter people in your sample case...

Alien: 2013-06-08 03:13:31

EASY1 , but question does not clarify the sorting ...for maximizing the sum

aar: 2013-06-07 19:38:21

MMDS has not done its job..

Erti-Chris Eelmaa: 2013-05-27 19:25:19

Very easy. Took me 3-4 minutes.

Filipe Bittencourt [UNIFEI]: 2013-04-17 04:17:42

MMDS hasn't done it's job!
Unfortunately got my first WA because of this wrong information!
Easily solved.


Added by:Matthew Reeder
Date:2006-10-29
Time limit:0.970s
Source limit:30000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:Al-Khawarizm 2006