Problem 2099 · Easy
Keep a length-k subsequence with maximum sum while preserving original order.
Open the interactive visualisation