<div class="_1l1MA">Greedy algorithm.</div>

<div class="_1l1MA">Sort items in non-increasing order of profits.</div>

<div class="_1l1MA">Select the first <code>k</code> items (the top <code>k</code> most profitable items). Keep track of the items as the candidate set.</div>

<div class="_1l1MA">For the remaining <code>n - k</code> items sorted in non-increasing order of profits, try replacing an item in the candidate set using the current item.</div>

<div class="_1l1MA">The replacing item should add a new category to the candidate set and should remove the item with the minimum profit that occurs more than once in the candidate set.</div>