Just wanted to post an organized answer based on my conversation with @Mathmo123 in the comments - all credit goes to him.
Denote the roots of $f$ as $\alpha_1,\alpha_2,\alpha_3$ if $f$ is irreducible, it is the minimal polynomial of it's roots. This means that $[\mathbb{Q}(\alpha_1):\mathbb{Q}]=\deg f=3$ meaning $|G|=[\mathbb{Q}(\alpha_1,\alpha_2,\alpha_3):\mathbb{Q}]=[\mathbb{Q}(\alpha_1,\alpha_2,\alpha_3):\mathbb{Q}(\alpha_1)]\cdot[\mathbb{Q}(\alpha_1):\mathbb{Q}]$ is dibisible by 3.
Note that if there are repeating roots, it means that we can't have a complex root, since every polynomial of off degree has a real root, and if there is a complex root it's conjugate is also a root, and these are all the roots (since $\deg f=3$) and they are all different. So we can now assume the other case: there are no repeating roots.
Since each element in $G$ is a permutation of $f$'s roots, $G\leq S_3$, meaning $|G|=3$ or $|G|=6$, but for $G$ since $S_3$ isn't cyclic, $|G|\neq 6$ therefore $|G|=3$ and $G\simeq \mathbb{Z}_3$. Each element in $G$ therefore is either of order 1 (the neutral element) or of order 3.
Assume towards a contradiction $f$ has a complex root. As we said before, we know that a polynomial of an odd degree must have a real root, meaning f has one real root, a complex root, and the conjugate of that complex root as it's final root.
This means the conjugation automorphism is non-trivial, and is of order 2, but we said that $G\simeq \mathbb{Z}_3$ has no elements of order 2 - which is a contradiction. Meaning all roots of $f$ must be real.