C++ 数组排序返回下标
std::vector<int> laneId_point_x;
//laneId_point_x.push_back(...)要排序之前对数组进行赋值
vector<int> idx_1(laneId_point_x.size()); //用来记录索引号的
for (int i = 0; i < laneId_point_x.size(); i++)
{
idx_1[i] = i;
}
//下面函数根据数组从小到大排列顺序,对索引号进行相应的排序,排序返回下标
sort(idx_1.begin(),idx_1.end(),[&laneId_point_x](int i1, int i2) {return laneId_point_x[i1] < laneId_point_x[i2]; });