백준 [ALGORITHM] - 커트라인 (25305)

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

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

int main() {
    int count;
    int n;

    scanf("%d %d", &count, &n);

    int* arr1 = (int*)malloc(count * sizeof(int));

    for (int i = 0; i < count; i++) {
        scanf("%d", &arr1[i]);
    }

    qsort(arr1, count, sizeof(int), compare);

    if (n <= count) {
        printf("%d", arr1[count - n]);
    }

    free(arr1);

    return 0;
}