{"id":"subsequence-limited-sum-greedy-sort","text":"Sorting `nums` ascending and taking smallest elements first guarantees maximum count under any sum budget; this greedy choice is optimal because swapping a larger element for a smaller one never decreases remaining capacity.","truth_value":"IN","source":"entries/2026/06/06/longest-subsequence-with-limited-sum-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":["sort-preprocessing-enables-linear-scan"],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"subsequence-limited-sum-greedy-sort","truth_value":"IN","reason":"premise"}]}}