在数组算法优化的解决方案中找到三个最大的整数？

def find_three_largest_numbers(arr):
    if len(arr) < 3:
        raise ValueError("Array must contain at least three numbers")
    
    first = second = third = float('-inf')
    
    for num in arr:
        if num > first:
            third = second
            second = first
            first = num
        elif num > second:
            third = second
            second = num
        elif num > third:
            third = num
    
    return [first, second, third]

# 示例用法
arr = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5]
print(find_three_largest_numbers(arr))  # 输出: [9, 6, 5]