[BAILIAN] hihoCoder Challenge 34 register

Ended

Participants:186

Verdict:Accepted
Submitted:2018-07-15 18:42:02

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <bits/stdc++.h>
using namespace std;
#define mo 100005
long long a[mo];
long long b[mo];
long long c[mo];
int main()
{
    long long t;
    cin>>t;
    long long re=1;
    while(t--)
    {
        long long n,m;
        cin>>n>>m;
        for(long long i=0;i<n;i++) cin>>a[i];
        for(long long i=0;i<m;i++) cin>>b[i];
        sort(a,a+n);
        sort(b,b+m);
        long long k=0;
        for(long long i=0;i<n;i++)
        {
            c[i]=max(a[i]*b[0],max(a[i],a[i]*b[m-1]));
        }
        sort(c,c+n);
        cout<<"Case #"<<re++<<": "<<c[n-2]<<endl;
    }
}
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX