A_Min_Max_Swap.cpp

#include<bits/stdc++.h>
#define Rajat_Joshi            main;
#define  CSE             ios_base::sync_with_stdio(false);
#define Joshi           cin.tie(NULL);
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
using namespace std;
#define read(type) readInt<type>()
#define ll long long
#define nL


#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define ab first
#define ba second
#define vi vector<int>
#define all(x) (x).begin(), (x).end()
#define umap unordered_map
#define uset unordered_set
#define MOD 1000000007
#define imax INT_MAX
#define imin INT_MIN
#define exp 1e9
#define sz(x) (int((x).size()))
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
int ttt=1; cin >> ttt;
while(ttt--) {
//_______________________________________________________//
Rajat_Joshi CSE;
cin>>n;
       cin>>n;
        int a[n],b[n];
        for(int i=0;i<n;++i)cin>>a[i];
        for(int i=0;i<n;++i){cin>>b[i];
            if(b[i]>a[i]){int tp=a[i];a[i]=b[i];b[i]=tp;}
        }
        sort(a,a+n);sort(b,b+n);
        cout<<a[n-1]*b[n-1]<<"\n";
}
return 0;
}