快排找Top K

#include 

using namespace std;
#define N 10
#define M 5
void myqsort(int (&a)[N],int start, int end, int k)
{
    if(starti && a[j] <= x) j--;
            a[i] = a[j];
            while(i < j && a[i] >= x) i++;
            a[j] = a[i];
        }
        a[i] = x;

        if(i-start+1 > k)
            myqsort(a,start,i-1,k);
        else if(i-start+1 == k)
        {
            for(int p = start; p <= i; p++)
                cout<