Spectral graph theory studies how the eigenvalues of a graph relate to the structural properties of a graph. In this paper, we solve three open problems in spectral extremal graph theory which generalize the classical Turán-type supersaturation results. (a) We prove that every $m$-edge graph $G$ with the spectral radius $λ(G) > \sqrt{m}$ contains at least $\frac{1}{144} \sqrt{m}$ triangles sharing a common edge. This result confirms a conjecture of Nikiforov, and Li and Peng. Moreover, the bound is optimal up to a constant factor. (b) Next, for $m$-edge graph $G$ with $λ(G) > \sqrt{(1-\frac{1}{r})2m}$, we show that it must contain $Ω_r (\sqrt{m})$ copies of $K_{r+1}$ sharing $r$ common vertices. This confirms a conjecture of Li, Liu and Feng and unifies a series of spectral extremal results on books and cliques. Moreover, we also show that such a graph $G$ contains $Ω_r (m^{\frac{r-1}{2}})$ copies of $K_{r+1}$. This extends a result of Ning and Zhai for counting triangles. (c) We prove that every $m$-edge graph $G$ with $λ(G) > \sqrt{m}$ contains at least $(\frac{1}{8}-o(1)) m^2$ copies of 4-cycles, and we provide two constructions showing that the constant $\frac{1}{8}$ is the best possible. This result settles a problem raised by Ning and Zhai, and it gives the first asymptotics for counting degenerate bipartite graphs. The key to our proof are two structural results we obtain for graphs with large spectral radii on their maximum degree and on existence of large structured subgraphs, which we believe to be of independent interest.