you give integer array num positive integer k you choose subsequence array sum element togetherWe define KSum array kth large subsequence sum obtain necessarily distinctreturn KSum arrayA subsequence array derive array delete element change order remain elementsnote subsequence consider sum 0 example 1input num 242 k 5output 2explanation all possible subsequence sum obtain follow sorted decrease order 6 4 4 2 2 0 0 2the 5sum array 2example 2input num 12341012 k 16Output 10explanation the 16sum array 10 Constraintsn numslength1 n 105109 numsi 1091 k min2000 2n