Codeforces Round #768 (Div. 2) 1631A - Min Max Swap Solution

                                           

Problem Link: https://codeforces.com/contest/1631/problem/A

 Solve in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

#include <bits/stdc++.h>

using namespace std;

int main()

{

    long long n,t,i;

    cin>>t;

    while(t--)

    {

        int mxa,mxb;

        mxa=mxb=0;

        cin>>n;

        int a[n+9],b[n+9];

        for(i=0; i<n; i++)

        {

            cin>>a[i];

            mxa=max(mxa,a[i]);

        }

        for(i=0; i<n; i++)

        {

            cin>>b[i];

            mxb=max(mxb,b[i]);

        }

        if(mxa>mxb)

        {

            for(i=0; i<n; i++)

            {

                if(a[i]<b[i])

                    swap(a[i],b[i]);

            }

            sort(b,b+n);

            cout<<b[n-1]*mxa<<endl;

        }

        if(mxa<=mxb)

        {

            for(i=0; i<n; i++)

            {

                if(a[i]>b[i])

                    swap(a[i],b[i]);

            }

            sort(a,a+n);

            cout<<a[n-1]*mxb<<endl;

        }

    }

}