------
## 最终结论
```python
def find_winner(arr, k):
    win_count = 0
    current_winner = arr[0]
    
    while True:
        if arr[0] > arr[1]:
            win_count += 1
            current_winner = arr[0]
            arr.append(arr[1])  # Move the loser to the end
            arr.pop(1)  # Remove the second element
        else:
            win_count = 1  # Reset win count for the new winner
            current_winner = arr[1]
            arr.append(arr[0])  # Move the loser to the end
            arr.pop(0)  # Remove the first element
        
        # Check if the current winner has won k times
        if win_count == k:
            return current_winner
```