kth Smallest

Problem Statement

Input Format

First line: N and K. Second line: N space-separated integers.

Output Format

Print the k-th smallest element (1-indexed K).

Constraints

1 <= K <= N <= 1000

Sample Input

5 3
7 10 4 3 20

Sample Output

7

Explanation

Sorting the array gives [3, 4, 7, 10, 20]. The 3rd smallest element is 7.

Starter Code

#include <stdio.h>

int main() {
    int n, k;
    if (scanf("%d %d", &n, &k) == 2) {
        int arr[n];
        for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
        // Write your code here
    }
    return 0;
}

Limits

• Time Limit: 1s
• Memory Limit: 256MB