#include<iostream>
#include<vector>
using namespace std;
void adjustHeap(int arr[], int i, int n)//3.调整大顶堆(仅是调整过程,建立在大顶堆已构建的基础上)
{
int j = i * 2 + 1;//子节点
while (j<n)
{
if (j + 1<n && arr[j] <arr[j + 1])//子节点中找较小的,构建大顶堆
{
j++;
}
if (arr[i] >arr[j])
{
break;
}
swap(arr[i], arr[j]);
i = j;
j = i * 2 + 1;
}
}
void sort(int arr[],int n)
{
for (int i = (n - 1) / 2; i >= 0; i--)//1.构建大顶堆
{
//从第一个非叶子结点从下至上,从右至左调整结构
adjustHeap(arr, i, n);
}
}
void getMinKNumsByHeap(int arr[], int k, int n,int a[])
{
for (int i = 0; i < k; i++) a[i] = arr[i];
sort(a, k);
for (int i = k; i < n; i++)
{
if (arr[i]<a[0])
{
a[0] = arr[i];
adjustHeap(a, 0, k);
}
}
for (int i = k - 1; i >= 0; --i)
{
swap(a[0], a[i]);
adjustHeap(a, 0, i);
}
}
int main()
{
int arr[] = { 5,2,31,422,5,32,3,32,6,42,243,32543,32,5,7,8 };
int n = sizeof(arr) / sizeof(arr[0]);
int k = 3;
int *a = new int[k];
getMinKNumsByHeap(arr, k, n,a);
for (int i = 0; i < k; i++)
{
cout << a[i] << " ";
}
system("pause");
return 0;
}