------
## 最终结论
```python
def min_Ops(arr, n, k):
    target = sum(arr) // n
    if sum(arr) % n != 0:
        return -1
    
    operations = 0
    for num in arr:
        operations += abs(num - target)
    
    return operations // (2 * k)

# Test cases
assert min_Ops([2,2,2,2],4,3) == 0
assert min_Ops([4,2,6,8],4,3) == -1
assert min_Ops([21,33,9,45,63],5,6) == 24
```