Find Largest Numbers

To find the m largest numbers in an array input, you can use a min-heap (PriorityQueue in Java). Iterate through the input array. For each number, add it to the min-heap. If the heap's size exceeds m, remove the smallest element (the root of the min-heap). After processing all numbers, the min-heap will contain the m largest elements. Finally, convert the heap to an array and sort it in ascending order.