Leetcode 2389. Longest Subsequence With Limited Sum

For each query, determine the maximum number of elements you can pick from nums (as a subsequence) whose sum is ≤ query — equivalent to choosing as many smallest elements as possible. Sort nums, build prefix sums, and for each query use binary search (or scan) on the prefix sums to get the count.