Packing degenerate graphs greedily

We prove that if G is a family of graphs with at most n vertices each, with constant degeneracy, with maximum degree at most O(n/log⁡n), and with total number of edges at most (1−o(1))(n2), then G packs into the complete graph Kn.