I have came across with interesting problem. Its a modification of subset sum problem.\n\nFor a given array of positive integers, We need to find the set of element containing maximum of elements and sum of these elements should be less than or equal to k.\n\nEg. 1.\n```\nArr = [1,2,3,4,5,6,7,8,9,10], k = 15\n\noutput: [1, 2, 3, 4, 10]\n```\n\nthere are other possible outputs such as \n\n```\n[1, 2, 3, 5, 9], [1, 2, 3, 6, 8], [1, 2, 4, 5, 8], [1, 2, 4, 6, 7], [1, 3, 4, 5, 7] \n```\n\nall above will be considered as correct answer.\n\nEg. 2\n```\nArr = [1,2,3,4,6], k = 11\n\noutput: [1, 2, 3, 4]\n```\n\nConstraints: \n1 <= arr.length <= 200\n1 <= arr[i] <= k <= 10^5\n1 <= k <= 10^5\n\nCan anyone help me solve this problem with minimal time & space complexity?

I have came across with interesting problem. Its a modification of subset sum problem.\n\nFor a given array of positive integers, We need to find the set of ele