GCJ--Minimum Scalar Product (2008 Round 1AA)

Problem

You are given two vectors v₁=(x₁,x₂,...,x_n) and v₂=(y₁,y₂,...,y_n). The scalar product of these vectors is a single number, calculated as x₁y₁+x₂y₂+...+x_ny_n.

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

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 v ₁ and v ₂ respectively.

Output

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.

Limits

Small dataset

T = 1000
1 ≤ n ≤ 8
-1000 ≤ x_i, y_i ≤ 1000

Large dataset

T = 10
100 ≤ n ≤ 800
-100000 ≤ x_i, y_i ≤ 100000

以下是我的AC代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
int s1[1000],s2[1000];
bool cmp(int a,int b){return a>b;}
int main()
{
	//freopen("A-large-practice.in","r",stdin);
	//freopen("output.out","w",stdout);
	int T;
	cin>>T;
	int temp=T;
	while(T--)
	{
		int n;
		scanf("%d",&n);
		ll ans=0;
		for(int i=0;i<n;i++)
		scanf("%d",&s1[i]);
		for(int i=0;i<n;i++)
		scanf("%d",&s2[i]);
		sort(s1,s1+n);
		sort(s2,s2+n,cmp);
		for(int i=0;i<n;i++)
		{
			ans+=(ll)s1[i]*s2[i];
		}
		
		printf("Case #%d: %lld\n",temp-T,ans);
	}
	return 0;
 }