堆排序实现数组排序对下标排序

堆排序详情https://blog.csdn.net/weixin_51287642/article/details/119416139?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522164212842216781685338098%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fblog.%2522%257D&request_id=164212842216781685338098&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2_blogfirst_rank_ecpm_v1~rank_v31_ecpm-1-119416139.nonecase&utm_term=%E6%8E%92%E5%BA%8F&spm=1018.2226.3001.4450

需要预存一个对应的下标数组

//堆排序
template <typename T>
void SortintNumbers_Solution(T &input, std::vector<int> &xiabiao, int number = 0);
template <typename T>
void sift(T &R, int start, int end, std::vector<int> &xiabiao);

//堆排序查找数组中最大的number个所在位置并修改数组中的数据
//泛型表示编译时不要报错
template <typename T>
void SortintNumbers_Solution(T &input, std::vector<int> &xiabiao, int number) {
	int i = 0, n = input.size();
	if (number == 0)
		number = n;
	input.insert(input.begin(), -100);//添加一个无关的元素使运算简便
	xiabiao.insert(xiabiao.begin(), 100);//添加一个无关的元素使运算简便
	for (i = n / 2; i >= 1; i--)//建立初始堆
		sift(input, i, n, xiabiao);//这里的n是指1~n个元素（不包含无关的元素）
	for (i = n; i > n - number && i > 1; i--) {
		std::swap(input[1], input[i]);//挑出最大的元素input[1]到input[i]
		std::swap(xiabiao[1], xiabiao[i]);//改变下标
		sift(input, 1, i - 1, xiabiao);//再对1~i-1的元素进行筛选
	}
	input.erase(input.begin());//删除无关的元素
	xiabiao.erase(xiabiao.begin());//删除无关的元素
}
template <typename T>
void sift(T &R, int start, int end, std::vector<int> &xiabiao) {
	int i = start, j = 2 * start;
	auto tmp = R[i];//自动匹配数据类型
	int tmp_xiabiao = xiabiao[i];
	for (; j <= end;) {
		if (j < end&&R[j] < R[j + 1])
			j++;
		if (tmp < R[j]) {
			R[i] = R[j];
			xiabiao[i] = xiabiao[j];//改变下标
			i = j;
			j = 2 * i;
		}
		else break;
	}
	R[i] = tmp;
	xiabiao[i] = tmp_xiabiao;
}