In a large stream of M items, what is the best way to identify the N largest item?

Possible options:

1. Store in memory and use mergesort on the whole array.

2. Create a Symbol Table with the items and sort based on it.

3. Create a Priority Queue and check for the N largest items.