Let $(K,+_K,*_K,{\leq}_K)$ be an non-Archimedean totally ordered field, i.e. ${\exists}k\,{\in}\,K:k\,{\neq}\,0_K\,{\land}\,{\forall}n\,{\in}\,\mathbb{N}:n{\vert}k{\vert}\,{\leq}\,1_K$. ${\vert}k{\vert}$ is defined as $k$ for $0_K\,{\leq}\,k$ and $-k$ otherwise.
How to prove that this field can't have the least upper bound property?
I have already proved that there exists a subset $I={\{x:0<x\,{\land}\,{\forall}n\,{\in}\,\mathbb{N}:n*_Kx<1_K}\}$ of $K$ for any such field and that $1_K$ is its upper bound. Now I don't know how to prove that there is no least upper bound $y$ for it. The source of my question, see Exercise 3., advises to consider $2y$ if $y\,{\in}\,I$ and $\frac{y}{2}$ if not, but I still don't know what to do.