Not-too-far Replacement

You are given an array $A$ of length $N+1$, denoted $[A_1, A_2,\ldots, A_{N+1}]$. You can perform the following operation on the array $A$: - Choose an index $i$ ($1 \leq i \leq N$) such that $A_i \leq 2\cdot A_{N+1}$. Then, swap the values of $A_i$ and $A_{N+1}$. That is, you can swap the element at index $N+1$ with some element of the array that's *at most* twice as large as it. You may per