Minimum swaps required to bring all elements less than k together

#User function Template for python3
'''
sliding window  . please check gfg.
'''
def minSwap (arr, n, k) :
    c=0
    t=min(arr)

    for i in range(n):
        if arr[i]>=t and arr[i]<=k:
            c+=1

    a=0
    ans=float('inf')
    for i in range(c):
        if arr[i]<=k:
            a+=1

    ans=c-a

    for i in range(c,n):
        if arr[i]<=k:
            a+=1
        if arr[i-c]<=k:
            a-=1
        ans=min(ans,c-a)
    return ans