Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #!/bin/python3
- import sys
- def findTI(x,k,x0):
- t=x[x0]+k
- for i in range(x0,len(x)):
- if x[i]>t:
- return i-1
- return x0
- def findHI(x,k,tI):
- t=x[tI]+k
- for i in range(tI,len(x)):
- if x[i]>t:
- return i
- return tI
- n,k = input().strip().split(' ')
- n,k = [int(n),int(k)]
- x = [int(x_temp) for x_temp in input().strip().split(' ')]
- x.sort()
- numT,h=0,0
- while True:
- t1=findTI(x,k,h)
- h=findHI(x,k,t1)
- numT+=1
- if x[t1]+k>=x[-1]:
- break
- print(numT)
Advertisement
Add Comment
Please, Sign In to add comment