It is a well-known rule of thumb that approximations of stochastic partial differential equations have essentially twice the order of weak convergence compared to the corresponding order of strong convergence. This is already known for many approximations of stochastic (ordinary) differential equations while it is recent research for stochastic partial differential equations. In this note it is shown how the availability of weak convergence results influences the number of samples in multilevel Monte Carlo schemes and therefore reduces the computational complexity of these schemes for a given accuracy of the approximations.