求一组数中前k个最大的数

#include<iostream>
using namespace std;
int partition(int a[],int s,int t)
{
int x;
x=a[s];
while(s<t)
{
while(s<t&&a[t]<x){t--;}
if(s<t){a[s++]=a[t];}
while(s<t&&a[s]>=x){s++;}
if(s<t){a[t--]=a[s];}
}
a[s]=x;
return s;
}
int FindKMax(int a[],int low,int high,int k)
{
if(low<high)
{
int q=partition(a,low,high);
int len=q-low+1;
if (len==k)
return q;
else if(len<k)
return FindKMax(a,q+1,high,k-len);
else 
return FindKMax(a,low,q-1,k);


}
}
int main()
{
int n;
cin>>n;
int *a;
a=new int[n];
for(int i=0;i<n;i++)
cin>>a[i];
FindKMax(a,0,n-1,4);
for(int i=0;i<4;i++)
cout<<a[i]<<" ";
system("pause");
return 0;




}