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-04-19 21:12:29 kishlay
how is it possible to solve it in 0.0 , did they do it without sorting
2014-03-27 19:25:45 vijay kumar
very easy.. got ac in first attempt..:)
2014-03-24 13:20:27 Aadithya U
got AC in one go.. :-) thanks to the comments.. for pointing that the sum has to be maximum :-)
2014-02-19 18:31:04 joud zouzou
@ mallipeddi akshay
Yes.
2014-01-09 10:42:12 mallipeddi akshay
should we find the maximum
plz reply ASAP

Last edit: 2014-01-09 10:42:33
2014-01-07 11:27:58 raj
my code runs correctly on ideone but on spoj it gives run time error i.e. SIGABRT.
Please help me soon!!!!
2014-01-02 09:56:04 Ankit Jain
just work out a simple example on paper...and you will be able to deduce the logic :)
2013-12-29 15:59:09 shivam mitra
what is the limit for the test cases t?? urgent required
2013-11-09 18:09:19 anonymous
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
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.