https://www.acmicpc.net/problem/11004
시간 제한 : 2초
메모리 제한 : 512MB
# Merge Sort -> Dived & conquer
def merge_sort(array):
if len(array) <= 1:
return array
mid = len(array) // 2
left = merge_sort(array[:mid])
right = merge_sort(array[mid:])
i, j, k = 0, 0, 0
while i < len(left) and j < len(right):
if left[i] <= right[j]:
array[k] = left[i]
i += 1
else:
array[k] = right[j]
j += 1
k += 1
if i == len(left):
while j < len(right):
array[k] = right[j]
j += 1
k += 1
elif j == len(right):
while i < len(left):
array[k] = left[i]
i += 1
k += 1
return array
n, k = map(int, input().split())
array = list(map(int, input().split()))
array = merge_sort(array)
print(array[k-1])
# python 기본 라이브러리 이용
n, k = map(int, input().split())
array = list(map(int, input().split()))
array = sorted(array)
print(array[k-1])