values and an integer k. You may pick any set of elements from the array (including the empty one, which totals 0, or the whole array) and add them up. There are 2ⁿ picks, each with its own total.
List the totals of all picks in decreasing order, keeping repeats: picks with the same total are still different picks. Return the k-th total in that list (1-based).values=[3, -1, 2], k=4 → 2
All subset totals in decreasing order: 5, 4, 3, 2, 2, 1, 0, -1. The fourth one is 2.
values=[-5, -7], k=1 → 0
The best choice is to take nothing: the empty pick totals 0.
values=[4, 4, 4], k=3 → 8
Totals in decreasing order: 12, 8, 8, 8, 4, … Equal totals count separately, so the third one is also 8.
values=[3, -1, 2], k=4
2
Run checks the first 3 tests in your browser. Submit checks all 100 tests on the server, hidden ones included.