[Solution] Mark the Photographer Codeforces Solution

A. Mark the Photographer

time limit per test
memory limit per test
input
output
standard output standard input256 megabytes1 second

Mark is asked to take a group photo of 2n$2n$ people. The i$i$-th person has height hi$h_i$ units.

To do so, he ordered these people into two rows, the front row and the back row, each consisting of n$n$ people. However, to ensure that everyone is seen properly, the j$j$-th person of the back row must be at least x$x$ units taller than the j$j$-th person of the front row for each j$j$ between 1$1$ and n$n$, inclusive.

mohit

Help Mark determine if this is

Input

The first line contains one integer t$t$ (1≤t≤100$1\le t\le 100$) — the number of test cases. Each test case consists of two lines.

The first line of each test case contains two positive integers n$n$ and x$x$ (1≤n≤100$1\le n\le 100$, 1≤x≤103$1\le x\le {10}^3$)

Mark and the Online Exam Codeforces Solution

Mark and Professor Koro Codeforces Solution

Mark and Lightbulbs Codeforces Solution

Mark and His Unfinished Essay Codeforces Solution

Mark the Dust Sweeper Codeforces Solution

Mark the Photographer Codeforces Solution

 — the number of people in each row and the minimum difference Mark wants.

The second line of each test case contains 2n$2n$ positive integers h1,h2,…,h2n$h_1,h_2,\dots ,h_{2n}$ (1≤hi≤103$1\le h_i\le {10}^3$) — the height of each person in units.

Note that the sum of n$n$ over all test cases is not bounded.

Output

For each test case, print a single line containing "YES" if Mark could arrange people satisfying his condition and "NO" otherwise.

You may print each letter in any case (for example, YES, Yes, yes, yEs will all be recognized as positive answers).