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
janus_syrak: 2018-05-23 21:30:58

The explanation is incorrect. You need to sort first, and then multiply.

mahakaal2018: 2018-05-03 10:30:09

AC in one go!!!

ayush_1996: 2018-03-28 14:11:05

AC in one go :D

pshishod2645: 2018-03-21 08:39:12

https://en.wikipedia.org/wiki/Rearrangement_inequality
Rearrangement inequality

zoyron: 2018-02-27 23:37:13

wrong explanation of the question.

aksh16: 2018-02-19 13:19:09

Did anyone get segmentation fault?

rvlewerissa: 2018-02-14 17:33:26

please make a clearer explanation

Last edit: 2018-02-14 17:33:48
payal2621: 2018-01-21 19:35:44

ac in one go!!!
sort the array using selection sort

feed_me_pizza: 2017-11-22 23:37:54

Guys sort first to maximise the hotness, then multiply.

kkislay20: 2017-10-31 18:17:36

Really simple, AC in one go


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