Sum of the elements

Problem Statement

Sum of the elements Problem Description Given N distinct elements. You have to distribute these elements in two parts such that the sum of elements that each part receives must be greater than K. Find out the number of ways in which you can distribute the elements so that the mentioned condition holds true. Since the answer can be large, print it in modulo 10 9 + 7. Function description Complete the solve function. This function takes the following 3 parameters and returns the answer. Parameters: K Represents the given integer value. arr Represents the elements of the array. N Represents the size of the array arr. Input format for custom testing Note: Use this input format if you are testing against custom input or writing code in a language where we don't provide boilerplate code. The first line contains two space-separated integers N and K. The second line contains N space-separated integers where the i th integer denotes the i th element. Output format Print the number of ways in wh