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

template <typename FI ,class L >
std::vector<int> sorta(FI begin, FI end, L comp_proc){
    size_t size = std::distance(begin, end);
    using T = typename std::iterator_traits<FI>::value_type;

    std::vector <int> indexs(size);
    for (size_t i = 0; i < indexs.size(); i++)
        indexs[i] = i;

    std::sort(begin, end, [&comp_proc,&begin,&indexs](const T& l_item,const T& r_item){

        size_t l_dis = std::distance(&(*begin),const_cast<T*>(&l_item));//not working correctly
        size_t r_dis = std::distance(&(*begin),const_cast<T*>(&r_item));//not working correctly
        std::cout << l_item<<"**"<<&l_item <<"**"<<l_dis << "**" << r_dis << std::endl;

        bool res = comp_proc(l_item, r_item);
        if (const_cast<T*>(&l_item) > &(*begin) && const_cast<T*>(&r_item) > &(*begin)){
            if (res){
                std::swap(indexs[l_dis], indexs[r_dis]);//not working
            }
        }

        return res;
    });
    return indexs;

}

int main()
{
    std::vector<int> a{1,5,3,4,7};
    std::vector<int> indexes=sorta(a.begin(),a.end(),[](const int& a,const int& b){return a<b;});

    std::cout<<"\n";
    for(auto i:indexes)
    {
        std::cout<<i<<"\n";
    }
}