What are the disadvantages of the current approach of sorting the entire list each time getTop is called?

Main disadvantages of sorting the entire list each time getTop is called:

• Time inefficiency: sorting the entire list is an operation with a time complexity of O(n log n), which significantly slows down performance with frequent calls.
• Redundant calculations: if data changes infrequently, re-sorting on each request is an unnecessary use of resources.
• Scalability issues: as the volume of data grows, performance drops, which can lead to delays.

It is better to use data structures optimized for selecting the top-N elements, such as a heap (PriorityQueue), or maintain a sorted structure with incremental updates.