Given an array and an integer K, what is the maximum possible sum that can be achieved from the array elements such that sum is not greater than K?

Question

I tried using the greedy approach but the approach is wrong. The only way I got is using all the array elements less than K and trying all possible combinations.

Is t