C
\nint cmp(const void* a, const void* b){\n    return *(int*)a - *(int*)b;\n}\nint* getStrongest(int* arr, int arrSize, int k, int* returnSize){\n    qsort(arr, 
```\nint cmp(const void* a, const void* b){\n    return *(int*)a - *(int*)b;\n}\nint* getStrongest(int* arr, int arrSize, int k, int* returnSize){\n    qsort(arr, arrSize, sizeof(int), cmp);\n    int median = arr[(arrSize-1)/2];\n    int* ans = malloc(k * sizeof(int));\n    int left = 0, right = arrSize-1;\n     for(int i = 0; i < k; i++){\n        if((arr[right] - median) >= (median - arr[left])){\n            ans[i] = arr[right];\n            right--;\n        }\n        else{\n            ans[i] = arr[left];\n            left++;\n        }\n    }\n    *returnSize = k;\n    return ans;\n}\n\n```
[]