Remove the fewest distinct values to delete half the array

Pick a set of distinct values and delete every occurrence of each from an integer array. Return the smallest set size that removes at least half of the elements. Explain the greedy by frequency and whether you can avoid a full sort.