头文件的代码

include <limits.h>

include <stdlib.h>

include<stdio.h>

ifndef HEAP

define HEAP

define Cap 20

struct Heap;

typedef struct Heap *H;
H Initialize (H heap );
int Isfull (H heap);
int Isempty( H heap);
void Insert (H heap ,int num);
void DeleteMin(H heap);
void printf_all (H heap);

endif

struct Heap
{
int Capacity; //数组容量
int Size; //当前数量
int* List;
};

定义函数的源文件代码

H Initialize (H heap)
{
if(!heap)
return heap;
heap =(H)malloc(sizeof(struct Heap));
if(!heap)
{
perror("malloc error") ;
exit(EXIT_FAILURE);
}
heap->List=(int)malloc((Cap+1)sizeof(int));
if(!heap->List)
{
perror("malloc error") ;
exit(EXIT_FAILURE);
}
else
{
heap->Capacity=Cap;
heap->Size=0;
heap->List[0]=INT_MIN;

}
return heap;

}
int Isempty (H heap)
{
return !!(heap->Size0);
}
int Isfull(H heap)
{
return !!(heap->CapacityCap);
}
void Insert (H heap, int num)
{
int i;
if(!heap)
{
perror("heap is empty") ;
exit(EXIT_FAILURE);
}
for(i=heap->Size+1;heap->List[i/2]>num;i/=2)
heap->List[i]=heap->List[i/2];
heap->List[i]=num;

}
void DeleteMin(H heap)
{
int i,child;
int Min,Max;
if(!heap)
{
perror("heap is empty") ;
exit(EXIT_FAILURE);
}
Min=heap->List[1];
Max=heap->List[heap->Size-1];
for(i=1;i=2<=heap->Size;i=child)
{
child=i2;
if(heap->Size>child&&heap->List[child]>heap->List[child+1])
child++;
if(Max>heap->List[child])
heap->List[i]=heap->List[child];
else
break;
}
heap->List[i]=Max;
}
void printf_all (H heap)
{
for(int i=1;(heap->Size+1)>i;i++)
printf("1");
}
包含main（）源文件代码

include"Header.h "

int main()
{
struct Heap *heap=NULL;

heap=Initialize(heap); 
int n=0;
while(scanf("%d",&n)==1)
{
	Insert(heap,n);
}

printf_all(heap);

}