def minNumberOfOperations(A, N):
ts = sum(A)
    if ts < N:
        return -1
    t = ts - N
    if t == 0:
        return len(A)
    
    ml, l, cs = -1, 0, 0
    
    for r, val in enumerate(A):
        cs += val
        while cs > t:
            cs -= A[l]
            l += 1
        if cs == t:
            ml = max(ml, r - l + 1)
    
    return len(A) - ml if ml != -1 else -1

All codes available

public int maximumWeight(int input1, int input2, int[] input3) {
        int N = input1;
        int X = input2;
        int[] A = input3;

        Arrays.sort(A);

        int totalWeight = 0;
        int count = 0;
        for (int i = 0; i < N; i++) {
            if (totalWeight + A[i] <= X) {
                totalWeight += A[i];
                count++;
            } else {
                break;
            }
        }

        return count;
    }