def min_Ops(arr, n, k):
    if n <= 1:
        return 0
    arr = sorted(arr)
    if arr[0] == arr[-1]:
        return 0

    groups = 1
    for i in range(1, n):
        if arr[i] != arr[i - 1]:
            groups += 1

    if k >= groups:
        return 0
    if k == 1:
        return -1
    return (groups - 1 + (k - 2)) // (k - 1)