The sparse encoding consumes less memory than the full encoding. This is because it requires a smaller matrix for the decoding procedure, which in turn leads to fewer plaintexts and fewer rotation keys (which can occupy a lot of memory when the ring dimension is high). Given that you reuse these same decoding matrix for all the sparse ciphertexts, the total memory should be lower.