Lunch War with the Donkey CSU

Jingze is a big figure in California State University for his stubbornness. Because of his new failure in the last CET-4, he has decided not to solve problems with English discription any more. In yesterday‘s warm-up contest，he protested to the organizing committee for the appearance of long English discription and threatened to eat all the bread of the contestants during coding. Undoubtedly, this behavior will seriously affect the entire competition. In order to help him get rid of English phobias, good-hearted seniors decided to help him regain his confidence with simple English problems. This problem is a gift that we gave to all contestants who are in the same boat with him.

In today's campus coding match, the contestants brought a variety of bread and milk, and each kind of bread and milk has its own deliciousness. Because Jingze can't just eat bread, he will also wipe out a carton of milk when eating a loaf of bread. If only bread or only milk leaves to have, his appetite will be zero. Since bread and milk are amazing lunch partners, different combinations bring different tastes. Everyone knows the deliciousness of some combination is defined to be its product. Of course the maximum sum of deliciousness is desired for Jingze while the minimum for us, although in both cases we seem to be disadvantaged.

In fact, the Lunch War will never happen and the following gif may be your live picture of today's early reading time and closing ceremony.

Input

There are at most 20 test case.

For each test cases, you are given the number of kinds of bread and milk, N, M for each and 1 ≤ N, M ≤ 10⁵.

In the following two lines are N + M positive integers denoting the deliciousness for each kind of bread and milk.

The deliciousness is guaranteed within 100.

Output

Two integers per line for each test: The maximum and minimum sum of deliciousness for Jingze and us.

Sample Input

1 4
23 
67 50 25 2 

10 6
95 30 2 18 96 6 5 52 99 89 
24 6 83 53 67 17 

Sample Output

1541 46
22884 2073

em 就是求上下组合起来乘积和最大值、最小值。
最大值很好说就是最大乘最大。
最小值的话，大值乘小值就是了

#include<iostream>
#include<cstdio>
#include<algorithm>

using namespace std;
const int maxn = 100005;
int a[maxn];
int b[maxn];

int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=0; i<n; ++i)
        {
            scanf("%d",&a[i]);
        }
        for(int i=0; i<m; i++)
        {
            scanf("%d",&b[i]);
        }
        sort(a,a+n);
        sort(b,b+m);
        int minn = min(n,m);
        int max_sun = 0, min_sum = 0;
        for(int i=0; i<minn; ++i)
        {
            max_sun += a[n-i-1]*b[m-i-1];
            min_sum += a[i]*b[minn-i-1];
        }
        printf("%d %d
",max_sun,min_sum);
    }
}