Sort one vector using another in nondecreasing order

This mean that while I am sorting the v2 in the nondecreasing order, the v1 should looks like that.

Vectors look as following.

v1  = {0, 5, 5, 2, 10};
v2  = {0 , 2, 6, 20, 5};

The output:

v1 = {2, 5, 10, 5, 0};
v2 = {20 , 6, 5, 2};

I was trying to solve that problem mixing std::sort and lambdas. That is why I have read several questions about std::sort, there were no answers which solve the problem similar to mine so that is why I am asking.

I am especially interested in the answers which contains it's usage or other features of C++11 and C++14.

It is not a question like: "I completely do not know what to do." I know how to achieve the output using C++98, but I am wondering if there is an more efficient and prettier way to do it.

Thanks in advance for your help.