What's faster: inserting into a priority queue, or sorting retrospectively?

Question

What\'s faster: inserting into a priority queue, or sorting retrospectively?

I am generating some items that I need to be sorted at the end. I was wondering, what is

Answer 1

On a max-insert priority queue operations are O(lg n)