def twoArrays(k, A, B):
    A =  sorted(A, reverse=True)
    B =  sorted(B)
    
    for i, num in enumerate(A):
        if A[i] + B[i] < k:
            return 'NO'
    
    return 'YES'

import functools
import typing


def twoArrays(k: int, A: list[int], B: list[int]) -> typing.Literal["NO", "YES"]:
    A.sort()
    B.sort(reverse=True)
    return "NO" if any(a + b < k for a, b in zip(A, B, strict=True)) else "YES"


def twoArrays(k: int, A: list[int], B: list[int]) -> typing.Literal["NO", "YES"]:
    @functools.lru_cache
    def cached_helper(ab: tuple[int, int]) -> bool:
        return sum(ab) < k

    A.sort()
    B.sort(reverse=True)
    return "NO" if any(map(cached_helper, zip(A, B, strict=True))) else "YES"



# 88
s=sorted;twoArrays=lambda k,A,B:["YES","NO"][any(a+b<k for a,b in zip(s(A),s(B)[::-1]))]

def twoArrays(k, A, B):
    A.sort()
    B.sort(reverse=True)
    for i in range(len(A)):
        if A[i] + B[i] < k:
            return "NO"
    return "YES"

fn twoArrays(k: i32, A: &mut [i32], B: &mut [i32]) -> String {
    A.sort();
    B.sort();
    
    for (a, b) in A.iter().zip(B.iter().rev()) {
        if a + b < k {
            return "NO".to_string();
        }
    }
    
    "YES".to_string()
}