def min_Ops(arr, n, k):
    if n == 0:
        return 0

    unique_values = sorted(set(arr))
    if len(unique_values) == 1:
        return 0

    operations = 0
    remaining_distinct = len(unique_values)

    for i in range(len(unique_values) - 1, 0, -1):
        diff = unique_values[i] - unique_values[i - 1]
        if diff > 0:
            operations += diff * remaining_distinct
            if operations >= k:
                return k
        remaining_distinct -= 1

    return operations if operations < k else k