Hust oj 1754 Minimum Scalar Product（水题）

本文链接：https://blog.youkuaiyun.com/Sara_YF/article/details/52435103

Minimum Scalar Product

Time Limit: 1000 MS

Memory Limit: 65536 K

Total Submit: 78(40 users)

Total Accepted: 41(38 users)

Rating:

Special Judge: No

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

There are multiple test cases.

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

Process to the end of file.

Output

For each test case, output a line X, where X is the minimum scalar product of all permutations of the two given vectors.

Sample Input

Sample Output

-25
6

给你俩数组，问俩数组乘积之和最小是多少

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

const int Maxn = 1000;
typedef long long ll;
ll a[Maxn];
ll b[Maxn];
int n;

int main()
{
    while(~scanf("%d",&n))
    {
        for(int i=0;i<n;i++)
        {
            scanf("%lld",&a[i]);
        }
        for(int i=0;i<n;i++)
        {
            scanf("%lld",&b[i]);
        }

        sort(a,a+n);
        sort(b,b+n);
        ll sum = 0;
        for(int i=0;i<n;i++)
        {
            sum += a[i] * b[n-1-i];
        }
        printf("%lld\n",sum);

    }
}