A Compatible Pair（CodeForces 934A）

最新推荐文章于 2018-10-22 21:30:37 发布

Baiyi_destroyer

最新推荐文章于 2018-10-22 21:30:37 发布

阅读量212

点赞数

分类专栏：水题集

本文链接：https://blog.csdn.net/Baiyi_destroyer/article/details/81074699

版权

水题集专栏收录该内容

98 篇文章 0 订阅

订阅专栏

Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of which frighten the monster out of coming.

Little Tommy has n lanterns and Big Banban has m lanterns. Tommy's lanterns have brightness a1, a2, ..., an, and Banban's have brightness b1, b2, ..., bm respectively.

Tommy intends to hide one of his lanterns, then Banban picks one of Tommy's non-hidden lanterns and one of his own lanterns to form a pair. The pair's brightness will be the product of the brightness of two lanterns.

Tommy wants to make the product as small as possible, while Banban tries to make it as large as possible.

You are asked to find the brightness of the chosen pair if both of them choose optimally.

Input

The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 50).

The second line contains n space-separated integers a1, a2, ..., an.

The third line contains m space-separated integers b1, b2, ..., bm.

All the integers range from - 109 to 109.

Output

Print a single integer — the brightness of the chosen pair.

Examples

input

2 2
20 18
2 14

output

input

5 3
-1 0 1 2 3
-1 0 1

output

Note

In the first example, Tommy will hide 20 and Banban will choose 18 from Tommy and 14 from himself.

In the second example, Tommy will hide 3 and Banban will choose 2 from Tommy and 1 from himself.

题解：Banban将会从Tommy的序列中取走一个数，和自己序列的一个数组成乘积最大。但是Tommy希望Banban最终组成的数尽可能小，而且它将会提前从自己序列中取走一个数以此来达到目的。数据较小，直接暴力。

代码如下：

#include <iostream>
#include <cstdio>
#include <stdlib.h>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include<ctime>
#define maxn 100007
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define lowbit(x) (x&(-x))
#define eps 0.00000001
using namespace std;
typedef long long ll;
long long int a[55],b[55],c[55];
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=0; i<n; i++)
        cin>>a[i];
    for(int i=0; i<m; i++)
        cin>>b[i];
    sort(b,b+m);
    int k=0;
    for(int i=0; i<n; i++)
    {
            c[k++]=max(b[0]*a[i],a[i]*b[m-1]);//考虑全负的情况
    }
    sort(c,c+k);
    cout<<c[k-2]<<endl;
    return 0;
}