代码

#include <algorithm>
template<typename It,typename T>
It find_insert(It first,It last,T &&n)
{
    auto l=first-1,r=last;
    while(l+1<r)
    {
        auto mid = l+(r-l)/2;
        if(n<*mid)
        {
            r=mid;
        }
        else
        {
            l=mid;
        }
    }
    return r;
}
template <typename It>
void insert_sort(It begin, It end)
{
    for (auto it1 = begin+1;it1 < end;it1++)
    {
        auto it2 = it1-1;
        auto cur = std::move(it1[0]);
        while (it2 >= begin&&cur<it2[0])
        {
            it2[1] = std::move(it2[0]);
            it2--;
        }
        it2[1]=std::move(cur);
    }
}
void sort(unsigned *a, int n) {
	insert_sort(a, a + n);
}

评测结果