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: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-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.
2014-07-16 17:41:08 Siddhant Somani
Got AC in second attempt because I had ignored the "maximise" clause !
Question should have been clear.
2014-07-04 20:42:20 heena rana
cakewalk AC in one go... :D :D
2014-07-02 17:05:14 Mitch Schwartz
@Kumar Shubham: SPOJ allows you to read the compilation error.
2014-07-02 16:26:09 Kumar Shubham
My code shows compilation error here, it is running quite smoothly when compiled in my own machine with gnu-gcc compiler, though. Please help.
2014-06-12 19:43:03 Verna Rahul Omprakash
Who so ever has framed the question should clarify that the sum has to be maximized....
2014-05-20 11:54:17 Krish
Provide TestCase please
2014-05-20 11:52:38 Krish
I got Wrong Answer....... Please Provide Some TestCases
2014-05-18 07:29:26 vijay kumar
just a curly brace in the wrong place costs me ten submissions...finally got Green...!!!
2014-05-02 06:26:08 Robin Kumar
The problem statement is ambiguous. There is something extra u need to do apart from what is being asked to get AC :)
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.