Language: C++

#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vector<pll> A(N);
  vector<pll> B(N);
  REP(i, N) {
    ll a;
    cin >> a;
    A[i] = make_pair(a, i);
  }
  REP(i, N) {
    ll b;
    cin >> b;
    B[i] = make_pair(b, i);
  }

  sort(ALL(A));
  sort(ALL(B));

  ll ok = 0;
  REP(i, N) {
    if (A[i].first > B[i].first)
      ok = -1;
  }
  if (ok == -1) {
    cout << "No" << endl;
    return 0;
  }
  ok = 0;

  REP(bi, N) {
    FOR(ai, max(bi - 3, 0), N) {
      if (A[ai].first > B[bi].first)
        break;
      if (A[ai].first <= B[bi].first && A[bi].first <= B[ai].first &&
          (A[ai].second == B[bi].second || A[bi].second == B[ai].second)) {
        ok = 1;
        break;
      }
    }
    if (ok == 1)
      break;
  }
  if (ok == 1)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;

  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:110:16: error: no matching function for call to 'max(ll, int)'
  110 |     FOR(ai, max(bi - 3, 0), N) {
      |             ~~~^~~~~~~~~~~
a.cc:37:35: note: in definition of macro 'FOR'
   37 | #define FOR(i, a, b) for (ll i = (a); i < (b); i++)
      |                                   ^
In file included from /usr/include/c++/14/algorithm:60,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
a.cc:110:16: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
  110 |     FOR(ai, max(bi - 3, 0), N) {
      |             ~~~^~~~~~~~~~~
a.cc:37:35: note: in definition of macro 'FOR'
   37 | #define FOR(i, a, b) for (ll i = (a); i < (b); i++)
      |                                   ^
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5706 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5716 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note:   template argument deduction/substitution failed:
a.cc:110:16: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
  110 |     FOR(ai, max(bi - 3, 0), N) {
      |             ~~~^~~~~~~~~~~
a.cc:37:35: note: in definition of macro 'FOR'
   37 | #define FOR(i, a, b) for (ll i = (a); i < (b); i++)
      |                                   ^