查找最小的k个元素(数组)
题目:输入n个整数,输出其中最小的k个。
例如输入1,2,3,4,5,6,7和8这8个数字,则最小的4个数字为1,2,3和4。
//coder:LEE
//20120304#include<iostream>
#include<CASSERT>
#include <ctime>
#include <CWINDOW.H>
#define LEFT(i) 2*i
#define RIGHT(i) 2*i+1
using namespace std;
void Swap(int *a,int *b)
{
int t=*a;
*a=*b;
*b=t;
}
void MaxHeapify(int *A,int i,int length)//调整
{
int l=LEFT(i);
int r=RIGHT(i);
int largest=i;
if(l<=length)
{
if(A[l]>A[i])
largest=l;
}
if (r<=length)
{
if(A[r]>A[largest])
largest=r;
}
if(largest!=i)
{
Swap(&A[i],&A[largest]);
MaxHeapify(A,largest,length);
}
}
void BuildMaxHeap(int *A,int length)//构建堆
{
for(int i=length/2;i>0;i--)
MaxHeapify(A,i,length);
}
void MinK(int *data,int n,int *A,int length)
{
assert(data!=NULL&&A!=NULL&&n>0&&length>0);
for (int i=length;i<n;i++)
{
if (data[i]<A[1])//将数组其余内容与堆最大值比较,小于之,则替换,并调整最大堆
{
A[1]=data[i];
MaxHeapify(A,1,length);
}
}
}
int main()
{
const numbers=1000;
const int K=100;
int A[K+1];
int data[numbers];
cout<<"before:"<<endl;
for (int i=0;i<numbers;i++)
{
data[i]=rand()%numbers;
cout<<data[i]<<" ";
}
cout<<endl<<"after:"<<endl;
double beg=GetTickCount();
for(i=1;i<=K;i++)//用前K个值构建最大堆
A[i]=data[i];
BuildMaxHeap(A,K);
MinK(data,sizeof(data)/sizeof(int)-1,A,K);
double end=GetTickCount();
for(i=1;i<=K;i++)//输出K个最小值
cout<<A[i]<<" ";
cout<<endl<<"time:"<<(end-beg)<<"ms"<<endl;
return 0;
}