cf 934 A Compatible Pair

A. A Compatible Pairtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputNian 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.InputThe 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.OutputPrint a single integer — the brightness of the chosen pair.Examplesinput

2 2
20 18
2 14

output

252

input

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

output

2

NoteIn 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.
题意：tommy想让结果小，Banban 想让结果大，结果就是tommy拿走任意一个自己的灯笼是一种情况，取这些情况中最小的，情人节打cf也是醉了。

#include <iostream>
#include <climits>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <vector>

#define ll long long
#define REP(i, n) for (int i=0;i<n;++i)
#define REP_1(i, n) for (int i=1;i<=n;++i)
#define REP_2(i, j, n, m) REP(i, n) REP(j, m)
#define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m)

#define JU_RAN(a,x,b) a<=x&&x<=b

using namespace std;

ll a[55];
ll b[55];

const ll INF=(1LL<<60)-1;

void solve(){
ll m,n;
cin>>m>>n;
REP(i,m)cin>>a[i];
REP(i,n)cin>>b[i];

ll res=INF;
REP(i,m){
ll now=-INF;
REP(j,m)if(j!=i)REP(k,n)now=max(now,a[j]*b[k]);
res=min(res,now);
}
cout<<res<<endl;

}

int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);

#ifdef LOCAL_DEFINE
freopen("input.txt", "rt", stdin);
#endif

solve();

#ifdef LOCAL_DEFINE
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}