Max Min Discussions | Algorithms | HackerRank
We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Greedy
  4. Max Min
  5. Discussions

Max Min

  • [deleted]     + 3 comments

    This is exactly my way, but python is too slow and I get timeout in one of the test cases. anyone have any suggestion about optimizing this code:

    n=int(input())
k=int(input())
ls=sorted([int(input()) for i in range(n)])
mnt=ls[-1]-ls[0]
for i in range(n-k+1):
    seg=ls[i:i+k]
    d=seg[-1]-seg[0]
    if d<mnt:
        mnt=d
print(mnt)