Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include <bits/stdc++.h>using namespace std;#define mo 100005long 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;}}