SDUT 3401 数据结构实验之排序四：寻找大富翁

点击打开题目链接

#include <stdio.h>

int n, m;
struct Heap
{
  int data[12];
  int Size;
};
//建立最小堆
void HeapAdjust(Heap *H, int s, int len)
{
    int x = H -> data[s];
    for(int j = 2*s; j <= len; j*=2)
    {
        if(j < len && H -> data[j] > H -> data[j+1])
        {
            ++j;
        }
        if(x < H -> data[j])
        {
            break;
        }
        H -> data[s] = H -> data[j];
        s = j;
    }
    H -> data[s] = x;
}
//堆排序
void HeapSort(Heap *H, int len)
{
    for(int i = len; i > 1; --i)
    {
        int t = H -> data[1];
        H -> data[1] = H -> data[i];
        H -> data[i] = t;
        HeapAdjust(H, 1, i-1);
    }

}

int main()
{
    Heap *H = new Heap;
    scanf("%d %d", &n, &m);
    H -> Size = m;
    for(int i = 1; i <= m; i++)
    {
        scanf("%d", &H -> data[i]);
    }
    for(int i = m/2; i > 0; i--)
        HeapAdjust(H, i, m);//将需要排序的m个元素建成最小堆
    for(int i = m+1; i <= n; i++)
    {
        int x;
        scanf("%d", &x);
        if(x > H -> data[1])//与堆顶比较
        {
            H -> data[1] = x;
            for(int j = m/2; j > 0; j--)
                HeapAdjust(H, j, m);//更新最小堆
        }
    }
    HeapSort(H, m);//堆排
    for(int i = 1; i <= m; i++)
    {
        (i == m) ? printf("%d\n", H -> data[i]) : printf("%d ", H -> data[i]);
    }
    return 0;
}