Subsequence of Size K With the Largest Even Sum

Pick exactly k elements from an array to maximize their sum under the constraint that the sum must be even. Typical approach is greedy: take the k largest values, and if their sum is odd, adjust parity by swapping the smallest odd/even chosen element with the best opposite-parity candidate outside the selection (use sorting/heaps to find those quickly).