  A graph is $H$-Ramsey if every two-coloring of its edges contains a
monochromatic copy of $H$. Define the $F$-Ramsey number of $H$, denoted by
$r_F(H)$, to be the minimum number of copies of $F$ in a graph which is
$H$-Ramsey. This generalizes the Ramsey number and size Ramsey number of a
graph. Addressing a question of Spiro, we prove that
\[r_{K_3}(K_t)=\binom{r(K_t)}{3}\] for all sufficiently large $t$. We do so
through a result on graph coloring: there exists an absolute constant $K$ such
that every $r$-chromatic graph where every edge is contained in at least $K$
triangles must contain at least $\binom{r}{3}$ triangles in total.
