c – 以非递增顺序使用另一个向量对一个向量进行排序

#include <iostream>
#include <vector>
#include <algorithm>

//converts two vectors into vector of pairs
template <typename T,typename U>
auto zip(T t,U u) {
  std::vector<std::pair<typename T::value_type,typename U::value_type>> pairs;
  for (size_t i = 0; i < t.size(); ++i){
    pairs.emplace_BACk(u[i],t[i]);
  }
  return pairs;
}

//converts a vector of pairs,BACk into two two vectors
template <typename T,typename U,typENAME v>
void unzip(V pairs,T & t,U & u) {
  for (auto const& it: pairs){
    u.emplace_BACk(it.first);
    t.emplace_BACk(it.second);
  }
}


int main(){

  //vectors
  std::vector<int> v1  = {0,10};
  std::vector<int> v2  = {0,5};

  //zip vectors
  auto pairs = zip(v1,v2);

  //sort them
  std::sort(pairs.begin(),pairs.end(),std::greater<>());

  //unzip them
  v1.clear();
  v2.clear();
  unzip(pairs,v1,v2);

  //print
  std::cout << '\n';
  for (auto i: v1) std::cout << i << ' ';
  std::cout << '\n';
  for (auto i: v2) std::cout << i << ' ';
  std::cout << '\n';

}