SATA11 - Editorial

PROBLEM LINK:

Practice

Contest

Author: Akul Sareen

Tester: Anmol Sood

Editorialist: Akul Sareen

DIFFICULTY:

CAKEWALK

PREREQUISITES:

Sorting

PROBLEM:

Given a list of N integers find the Kth smallest number.

QUICK EXPLANATION:

Sort the list of integers in ascending order, and simply print the Kth 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.

thanks for the information.
SHAREitforpc

//