My Answer:
#!/bin/python3
import math
import os
import random
import re
import sys
# Complete the maxMin function below.
def maxMin(k, arr):
cal = 0
min = 1000000000
arr.sort()
for i in range(len(arr)-k+1):
cal = arr[i+k-1] - arr[i]
if(cal < min):
min = cal
return min
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
n = int(input())
k = int(input())
arr = []
for _ in range(n):
arr_item = int(input())
arr.append(arr_item)
result = maxMin(k, arr)
fptr.write(str(result) + '\n')
fptr.close()
댓글 없음:
댓글 쓰기