As demonstrated in the other answers, $g$ need not be strictly convex. However, under the additional assumption that the infimum is attained, i.e. $g(x) = \min_y f(x, y)$ for all $x$, one can show that $g$ is strictly convex:
Let $x_1, x_2$ be distinct points in the domain of $g$ and $0 < \lambda < 1$. Choose $y_1, y_2$ such that $g(x_1) = f(x_1, y_1)$ and $g(x_2) = f(x_2, y_2)$. Then
$$
\begin{align}
g(\lambda x_1 + (1-\lambda) x_2) &= \inf_y f(\lambda x_1 + (1-\lambda) x_2, y)\\
&\le f(\lambda x_1 + (1-\lambda) x_2), \lambda y_1 + (1-\lambda) y_2) \\
&\boxed{<} \lambda f(x_1, y_1) + (1-\lambda)f(x_2, y_2) \\
&= \lambda g(x_1) + (1-\lambda)g(x_2) \, .
\end{align}
$$