If you ignore the number of pieces, except that kings are not allowed, integer linear programming yields a minimum cost of
34, as in the other answer,
and a maximum cost of
54, with 23 pawns, 2 bishops, and 5 rooks:
\begin{matrix}&P&.&.&R&P&P&P&B\\&.&.&.&.&.&.&P&P\\&P&P&.&.&.&.&P&.\\&P&P&.&.&.&P&B&.\\&P&P&.&.&.&P&P&.\\&.&.&.&P&.&.&.&P\\&.&.&.&P&.&.&P&P\\&R&R&.&P&P&.&R&R\\\end{matrix}
If you restrict to one set of pieces (without a king),
the problem is infeasible.
If you restrict to one set of pieces (without a king) and relax to controlling each square at least once (instead of exactly once),
the minimum cost is
33:
\begin{matrix}&R&.&.&.&.&.&.&.\\&.&.&.&.&.&.&.&.\\&.&P&.&.&.&P&.&.\\&.&.&P&B&.&Q&.&.\\&.&.&.&P&.&.&.&.\\&.&.&P&B&.&.&.&.\\&.&P&.&.&.&P&.&.\\&.&.&P&.&.&.&.&R\\\end{matrix}
and the maximum cost is
39 (use all 15 pieces):
\begin{matrix}&.&.&N&.&.&.&.&.\\&.&.&.&P&P&.&.&.\\&.&.&P&.&P&.&.&.\\&R&.&.&.&B&P&.&.\\&.&.&.&.&.&.&.&.\\&.&.&B&.&N&.&.&.\\&P&.&P&P&.&.&Q&.\\&.&.&.&.&.&.&.&R\\\end{matrix}