Sphere Online Judge

SPOJ Problem Set (classical)

1025. Fashion Shows

Problem code: FASHION


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

Added by:Matthew Reeder
Date:2006-10-29
Time limit:2s
Source limit:30000B
Memory limit:256MB
Cluster: Pyramid (Intel Pentium III 733 MHz)
Languages:All except: ERL JS NODEJS PERL 6
Resource:Al-Khawarizm 2006

hide comments
2014-09-15 22:47:15 Saurabh Shukla
Maximize clause cost me a bunch of wrong answers...a cakewalk though


Last edit: 2014-09-15 22:48:18
2014-09-08 22:01:31 Nooger
endl caused me a wrong answer. silly mistake. easy question
2014-09-06 09:29:57 Prabhjyot Singh Sodhi
AC in first go...use the sort function of <algorithm> ... nice and easy :)
2014-09-04 20:11:07 Abhisek Mandal
the "maximize" clause is not properly highlighted in the question...
2014-08-30 19:13:37 ashish kumar
AC in one go
2014-08-29 08:01:37 Nabeel
used quciksort, insertionsort. bot timelimit exeeded, which algo to use?
2014-08-07 19:16:12 rituraj
got green in 2nd submission wasnt mentioned that sum has to be maximised credit :comments.
2014-08-06 20:31:01 Ravi Yadav
AC in 2nd go...
2014-08-03 19:19:01 mohsin mohammad
hmmmm AC in first go.Good problem of hashing.
2014-07-28 11:22:00 Madhur Bhargava
AC in 2nd go. We need to understand the maximize clause. Thanks to VARUN KUMARE for test cases.
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.