oj mrJudge
Toggle navigation
  • Login
    • Forget Password
      Login
User Image

Hello, Stranger

Guest
  • Analysis Mode
  • Problems
    • All Problems
    • Latest Problems
  • Join Us Now
  • Registration
  • Contact Us
  • Infomation
  • About
    • Terms of Use
    • Technical Specifications
    • Credits

scalars Batch , stdin/stdout

Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

scalars.html

Problem Description

You are given two vectors v1=(x1,x2,...,xn) and v2=(y1,y2,...,yn). The scalar product of these vectors is a single number, calculated as x1y1+x2y2+...+xnyn.

Suppose you are allowed to permute the coordinates of each vector as you wish. Choose two permutations such that the scalar product of your two new vectors is the smallest possible, and output that minimum scalar product.

Input

For each test case, the first line contains integer number n. The next two lines contain n integers each, giving the coordinates of v1 and v2 respectively.

Output

For each test case, output a single number Y, which is the minimum scalar product of all permutations of the two given vectors.

Limits

For the first 50% of the testcases, 1 <= n <= 8 and -1000 <= xi, yi <= 1000

For the other 50% of the testcases, 100 <= n <= 800 and -100000 <= xi, yi <= 100000

Acknowledgements

This question is not original, it is from Raffles Algo Express Day 6 (Class A) - Contest 1

It is not my fault that it had 510 testcases...

Sample Input

3
1 3 -5
-2 4 1

Sample Output

-25

Explanation of Sample Output

 (-5 * 4) + (-2 * 3) + (1 * 1) = (-20) + (-6) + 1 = -25 

Tags

Greedy

Subtasks and Limits

Subtask Score #TC Time Memory Scoring
1505001s32MBAverage
250101s32MBAverage

Judge Compile Command

g++-8 ans.cpp -o scalars -Wall -Wshadow -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512

Accepted Submissions

subIDUserTimeMax Time

Past Submissions

subIDUserTimeScore
mrJudge 09.05.20
Copyright © 2020 mrJudge. All rights reserved.