### PROBLEM LINK:

**Author:** Akul Sareen

**Tester:** Anmol Sood

**Editorialist:** Akul Sareen

### DIFFICULTY:

CAKEWALK

### PREREQUISITES:

Sorting

### PROBLEM:

Given a list of **N** integers find the **K**th smallest number.

### QUICK EXPLANATION:

Sort the list of integers in ascending order, and simply print the **K**th integer.

### EXPLANATION:

Same as the quick explanation.

### AUTHOR’S AND TESTER’S SOLUTIONS:

Author’s solution can be found here.

Tester’s solution will be uploaded later.