def iscovered(R):

    #stack

    global K,inf

    q=inf.copy()

    times=K

    tag=False

    while times>0:

        #print(q)

        if q==[]:

            break

        target=q[0]+R

        while q[0]<=target:#並不是O(n*k)

            q.pop(0)

            if q==[]:

                break

        times-=1

        #print(q)

    if len(q)>=1:

        return False

    else:

        return True

x=list(map(int,input().split()))

N=x[0]

K=x[1]

inf=list(map(int,input().split()))

inf.sort()

a=[i for i in range(1,(inf[-1]-inf[0]+1)]

right=len(a)-1

left=0

#抓出可以和不可以的交界

goodR=inf[-1]-inf[0]

#print(a)

while right>=left:

  #print(inf,K,sep=" ")

  mid=(left+right)//2

  #print(a[mid])

  if iscovered(a[mid])==True:

    goodR=a[mid]

    right=mid-1

  else:

    left=mid+1

print(goodR)

 

 

 

 

 

這行發生memoryerror    a=[i for i in range(1,(inf[-1]-inf[0]+1)]

你的a是多餘的，後面a[mid]直接改用mid+1就好了