#!/bin/python3
import math
import os
import random
import re
import sys
# Complete the maxMin function below.
def maxMin(k, arr):
s=sorted(arr)
li=[]
for i in range(len(s)-k+1):
li.append(s[i+k-1]-s[i])
ans=min(li)
return ans
if __name__ == '__main__':
n = int(input())
k = int(input())
arr = []
for _ in range(n):
arr_item = int(input())
arr.append(arr_item)
result = maxMin(k, arr)
print(str(result) + '\n')
Greedy Algorithms: Max Min
猜你喜欢
转载自blog.csdn.net/weixin_45405128/article/details/104283312
今日推荐
周排行