Efficient method to produce a list of triplets from three arrays, such that min - max is minimized?

Question

Consider three sorted arrays (these can bestd::vector, std::array, e.g., the container is of little importance, whatever is most s