Minimized difference

Problem Statement

Minimized difference Problem Description Given an array A of size N and a number K denoting the number of operations that has to be performed on array A . You have to return the minimum possible difference between the maximum and minimum element of the array A after performing K operations. An operation on array A is: Select any two indices i and j such that, 1 ≤ i, j ≤ N , where N is the size of the array A . Subtract 1 from A[i] and add 1 to A[j] . Print the minimum possible difference between the maximum and minimum element of the array after performing K operations. Function Description Complete the function solve() . This function takes 3 parameters as arguments and returns the minimum possible difference between the maximum and minimum element of the array. long long solve (int N, long long K, long long* A) { // Write your code here } N: Represents the size of the array A . K: Represents the number of given operations. A: Represents an array of N integers. Input format for