实现查找数组中第N大的数,数组内容可重复

#include <stdio.h>
#include <stdlib.h>

void swap(int *a, int *b)
{
    int temp = *a;
    *a = *b;
    *b = temp;
}


/*查找数组中第N大的数,num为数组元素,n为第N大*/
int getmax_n(int *p, int num, int n)     
{
    int res = 0;
    int k = 0;
    for (int i = 0; (i < n); (p[res] == p[res -1]) ? 1 : i++)
    {
        int max = p[k];
        int maxi = k;
        for (int j = k + 1; j < num; j++)
        {
            if (max < p[j])
            {
                max = p[j];
                maxi = j;
            }
        }
        swap(&p[k], &p[maxi]);
        res = k++;
    }
    return p[res];
}


/*调用方式*/
int main()
{
    int a[11] = { 12, 11, 4, 69, 68, 68, 469, 67, 68, 69, 69 };
    printf("%d\n", getmax_n(a,11,11));

    system("pause");
    return 0;
}