c++ std:: algorithms with reverse order (end, beg)

I want to use std::copy on a vector but copying the elements in reverse order. Since vector::begin() returns a random access iterator it seems like something that would work.

Of course, I could use std::reverse before and after but that would be inefficient.