EOJ#2183 Minimum Scalar Product（最小数量积）

单点时限: 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.
样例：
input：
2
3
1 3 -5
-2 4 1
5
1 2 3 4 5
1 0 1 0 1
output：
Case #1: -25
Case #2: 6

题目大意是这样，给你T组数据，每组两个n阶向量，这两个向量里面元素位置可以随意摆放，比如：向量（1，2，3）随意摆放可能出现（3，2，1）或者（2，1，3）等情况
然后问你，如果我们随意调换元素位置，问两个向量的最小数量积是多少
众所周知，数量积，对应位置相乘后相加即可
而我们可以简单地玩个小贪心：
第一个向量里面最大的元素和第二个向量里面最小的元素相乘，第二大和第二小的相乘，以此类推，这样求出的数量及就是最小的
我也不知道这个贪心策略为什么是对的——反正他就是对的
顺便：注意输出时的格式，关于空格！

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#define rt long long
using namespace std;
inline rt read()
{
 register rt u=0,v=0;register char ch=getchar();
 while(!isdigit(ch)){if(ch=='-')v=1;ch=getchar();}
 while(isdigit(ch)){u=u*10+ch-'0';ch=getchar();}
 return v ? -u : u;
}
rt T,n,an[810],bn[810],ans;
bool cmp(rt a,rt b){return a>b;}
int main()
{
 T=read();
 for(int i=1;i<=T;i++)
 {
  n=read();
  ans=0;
  for(int j=1;j<=n;j++)
  an[j]=read();
  for(int j=1;j<=n;j++)
  bn[j]=read();
  sort(an+1,an+n+1);
  sort(bn+1,bn+n+1,cmp);
  for(int j=1;j<=n;j++)
  ans+=(bn[j]*an[j]);
  printf("Case #%d: %lld\n",i,ans);
 }
 return 0;
}