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
aditigedam: 2020-08-24 16:29:22

we have to find max sum of sum of the hotness bonds for all pairs that MMDS has proposed.

gokulan_cv: 2020-07-08 08:54:48

Just Sort The list and do the corresponding operations.

shrimp_bisque: 2020-07-04 15:17:46

This problem LIES. MMDS is a bum that has NOT done its job. Unlike the problem claims, you have to REDO the job of MMDS in addition to whatever else you would do.

bhavesh2712: 2020-05-25 06:01:37

AC in first go!!!
spoiler alert: sort both the lists(vector)

onkarj: 2020-05-17 10:51:43

MMDS has not done its job. You have to match pairs before computing sum of hotness bonds.

divyansh_09: 2020-05-12 00:32:18

AC in one Go!

pradeep_7: 2020-05-01 13:45:07

Hint :
Multiply maximum pair couple to get sum Max (MMDS)

codex_elldrago: 2020-04-16 18:40:40

Questions is to find the maximum sum.

shashankchdhry: 2020-04-09 06:59:00

The problem statement is misleading. MMDS has not done its job, you have to do it for them.

sudo_s: 2020-04-01 07:11:57

Savage SPOJ...Date yet to be decided LOL..


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