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.


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.


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.


1 1
3 2
2 3 2
1 3 2


Added by:Matthew Reeder
Time limit:0.970s
Source limit:30000B
Memory limit:1536MB
Cluster: Cube (Intel Pentium G860 3GHz)
Languages:All except: ERL JS NODEJS PERL 6
Resource:Al-Khawarizm 2006

hide comments
2014-12-19 07:19:10 slim shadyy
AC in 1 go!..:)
2014-12-18 09:44:29 kartikay singh
AC in 1 gO:)
do take care about max sum.....happy coding..)
2014-12-17 11:07:28 Swapnil Borse
Simple sort and multiply approach.. O(nlogn + n)
I wonder why it is there on SPOJ :P
2014-11-20 12:46:21 asitm9
Don't confuse with the word "maximize".
2014-11-08 22:18:56 Paweł
At first I thought there's got to be a hidden logic in x*y - maybe 0 * 5 should be equal to 5, but thankfully not. Adding a sort was enough. Either assume none of the input is correct and validate all or provide a valid input in the first place.
The puzzle is fun when a dev need to think how to solve. Correcting the wording of a specs I have to do at work.
2014-11-07 23:34:05 Sarthak Munshi
dont forget to sort ! costed me 1 WA
2014-10-22 17:16:18 Gopesh Tulsyan
Got accepted in the first go.O(nlogn + n)
2014-10-18 07:22:24 Rishabh Joshi
AC in first go! Very easy.
2014-10-14 00:26:02 Brian Silas Luke
AC in 1 go. c++ ftw :)
2014-10-05 13:00:19 NIKHIL KUMAR SINGH
A silly mistake costed me 1 CE
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.