Minimum Scalar Product(GCJ 2008 Round1A A)数学问题+贪心

来自《挑战程序设计竞赛》

1.题目原文

https://code.google.com/codejam/contest/32016/dashboard#s=p0

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

Sample

Input	Output
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

2.解题思路

直觉感觉把v1按升序、v2按降序排列，所得到的内积是最小的。下面来证明这一设想。

首先考虑n=2的情况。考虑v1=(x1,x2)，v2=(y1,y2)。假设v1已经按照升序排列，即x1<=x2，比较x1*y1+x2*y2与x1*y2+x2*y1的大小关系。

x1*y1+x2*y2-x1*y2-x2*y1=(x1-x2)*(y1-y2),可知y1<=y2等价于x1*x2+y1*y2<=x1*y2+x2*y1，因此n=2时结论成立。

当n大于2时，如果v2不是降序排列的，根据对n=2的情况分析知，交换可以使内积更小，这样下去直到v2按降序排列，就可以得到最小内积。

时间复杂度为O(nlogn)

3.AC代码

#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
#include<utility>
#include<queue>
using namespace std;

#define MAX_N 805
typedef long long ll;

int n;
int v1[MAX_N],v2[MAX_N];
void solve()
{
    sort(v1,v1+n);
    sort(v2,v2+n);
    ll ans=0;
    for(int i=0;i<n;i++){
        ans+=(ll)v1[i]*v2[n-1-i];
    }
    printf("%lld\n",ans);
}
int main()
{
    //注意GCJ需要提交输出文件，正式比赛还需要提交源代码
    freopen("A-large-practice.in","r",stdin);
    freopen("A-large-practice.out","w",stdout);
    int t,kase=0;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            scanf("%d",&v1[i]);
        }
        for(int i=0;i<n;i++){
            scanf("%d",&v2[i]);
        }
        printf("Case #%d: ",++kase);
        solve();
    }
    return 0;
}