#include <iostream>
using namespace std;
int part(int a[], int start, int e)
{
int i=start, j=e;
int pilot=a[i];
// cout<<pilot<<endl;
while(i<j)
{
// cout<<"i:"<<i<<"j:"<<j<<endl;
while(i<j && a[j]>=pilot) j--;
if(i<j) a[i]=a[j];
while(i<j && a[i]<pilot) i++;
if(i<j) a[j]=a[i];
}
a[i]=pilot;
return i;
}
void mimk(int a[], int n, int k)
{
int l=0, r=n-1;
int ind=part(a, l, r);
while(ind!=k-1)
{
// cout<<ind<<endl;
if(ind>k-1)
{
r=ind-1;
// cout<<r<<endl;
ind=part(a, l, r);
// cout<<ind<<endl;
}
else
{
l=ind+1;
ind=part(a, l, r);
}
}
for(int i=0; i<k; i++)
cout<<a[i]<<endl;
}
int main()
{
int a[]={10,4,5,9,1,11,3,8,3};
mimk(a, 9, 4);
return 0;
}
扩展:
求距离原点最近的k个点
#include <iostream>
#include <cmath>
using namespace std;
class point
{
public:
double x;
double y;
double dis;
point(double xx, double yy)
{
x=xx;
y=yy;
dis=sqrt(xx*xx+yy*yy);
}
};
int part(point a[], int start, int e)
{
int i=start, j=e;
point pilot=a[i];
double p=a[i].dis;
// cout<<pilot<<endl;
while(i<j)
{
// cout<<"i:"<<i<<"j:"<<j<<endl;
while(i<j && a[j]
.dis>=p) j--;
if(i<j) a[i]=a[j];
while(i<j && a[i].dis<p) i++;
if(i<j) a[j]=a[i];
}
a[i]=pilot;
return i;
}
void mimk(point a[], int n, int k)
{
int l=0, r=n-1;
int ind=part(a, l, r);
while(ind!=k-1)
{
if(ind>k-1)
{
r=ind-1;
ind=part(a, l, r);
}
else
{
l=ind+1;
ind=part(a, l, r);
}
}
for(int i=0; i<k; i++)
cout<<a[i].x<<" "<<a[i].y<<endl;
}
int main()
{
point points[]={point(1,2),point(1,3),point(4,2),point(2,2),point(1,1)};
mimk(points, 5, 2);
return 0;
}