93 人解决，150 人已尝试。
103 份提交通过，共有 570 份提交。
4.4 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
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.
The first line of the input file contains integer number T - the number of test cases. 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.
T = 10
100 ≤ n ≤ 800
-100000 ≤ xi, yi ≤ 100000
For each test case, output a line
Case #X: Y
where X is the test case number, starting from 1, and Y is the minimum scalar product of all permutations of the two given vectors.
2 3 1 3 -5 -2 4 1 5 1 2 3 4 5 1 0 1 0 1
Case #1: -25 Case #2: 6
93 人解决，150 人已尝试。
103 份提交通过，共有 570 份提交。
4.4 EMB 奖励。