TheAlgorithms-C/leetcode/src/215.c

int *cmpval (const void *a, const void *b) {
    return *(int *)b - *(int *)a;
}

int findKthLargest(int* nums, int numsSize, int k){
    qsort(nums, numsSize, sizeof(int), cmpval);
    return nums[k-1];
}