1798A - Showstopper - CodeForces Solution

#include <bits/stdc++.h>
using namespace std ;

#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
typedef long long ll ;
typedef unsigned long long ull ;
typedef long double ld ;

const ll MOD = 1E9 + 7, INF = 2E18 + 5 ;
const double PI = 2 * acos(0.0) ;
const long double EPS = 1.0E-14 ;

int arrA[105], arrB[105] ;

int main()
{
    fastIO ;
    ll t ;
    cin >> t ;

    while (t--) {
        int n, maxA, maxB ;
        bool isPossible = true ;
        cin >> n ;

        for (int i = 0; i < n; i++) {
            cin >> arrA[i] ;
        }

        for (int i = 0; i < n; i++) {
            cin >> arrB[i] ;
        }

        maxA = arrA[n - 1] ;
        maxB = arrB[n - 1] ;

        for (int i = 0; i < n; i++) {
            if ((arrA[i] <= maxA and arrB[i] <= maxB) or (arrA[i] <= maxB and arrB[i] <= maxA)) {
                continue ;
            }
            else {
                isPossible = false ;

                break ;
            }
        }

        if (isPossible) {
            cout << "Yes\n" ;
        }
        else {
            cout << "No\n" ;
        }
    }

    return 0 ;
}