You have to take the largest k numbers from the n numbers given in input and print the minimum number among them which is actually the k-th maximum number among the n numbers. This can be easily done by sorting. It was the giveaway problem of this contest.

Contributors

Statistics

91% Solution Ratio
riyad000Earliest, Jan '20
riyad000Fastest, 0.0s
NX4338Lightest, 0 B
bokaifShortest, 72B
Toph uses cookies. By continuing you agree to our Cookie Policy.