"I'm not sure what to do with the floor symbol while solving for x."
Ah! Subtle point. As $f$ is not injective you CAN'T solve for a unique $x$. You must solve for a set of possible values. And it's easy to do once you "wrap your head around it".
=======
To show serject you let $k$ be an arbitrary elemet of $\mathbb Z$ and see if $[\frac x2] = k$ is always possible.
It's possible if $k \le \frac x2 < k+1$ is possible.
And that is possible if $2k \le x < 2k + 2$ is possible.
So for any $k$ is it always the case that there exist real numbers that between $2k$ (inclusive) and $2k+2$ (exclusive)? The answer is, of course. $2k$ is a possible value so is $2k + 1$ so is $2k + .75$ and $2k + 1.415273860$ etc.
tl;dr
For every $k\in \mathbb Z$ then for $x =2k$ then $f(x) = [\frac {2k}2] = [k] = k$ so yes it is surjective.
To prove (non)injective you try to see if $f(x) = y$ always has a unique solution.
If $f(x) = [\frac x2] = y$ then
$y\le \frac x2 < y+1$ and $2y \le x < 2y+2$. But that's as far as we can go. Any $x' \in [2y, 2y+2)$ could give us that. So for example:
$f(x) = 10\implies 20 \le x < 22$ and $x_1 = 20$ and $x_2 = 21$ we have $f(x_1) = f(x_2)$ but $x_1\ne x_2$ so not injective.