Given an integer array arr of distinct integers and an integer k.
A game will be played between the first two elements of the array (i.e. arr[0] and arr[1]). In each round of the game, we compare arr[0] with arr[1], the larger integer wins and remains at position 0 and the smaller integer moves to the end of the array. The game ends when an integer wins k consecutive rounds.
Return the integer which will win the game.
It is guaranteed that there will be a winner of the game.
 
Example 1:
Input: arr = [2,1,3,5,4,6,7], k = 2
Output: 5
Explanation: Let's see the rounds of the game:
Round |       arr       | winner | win_count
  1   | [2,1,3,5,4,6,7] | 2      | 1
  2   | [2,3,5,4,6,7,1] | 3      | 1
  3   | [3,5,4,6,7,1,2] | 5      | 1
  4   | [5,4,6,7,1,2,3] | 5      | 2
So we can see that 4 rounds will be played and 5 is the winner because it wins 2 consecutive games.

Example 2:
Input: arr = [3,2,1], k = 10
Output: 3
Explanation: 3 will win the first 10 rounds consecutively.

Example 3:
Input: arr = [1,9,8,2,3,7,6,4,5], k = 7
Output: 9

Example 4:
Input: arr = [1,11,22,33,44,55,66,77,88,99], k = 1000000000
Output: 99

 
Constraints:

2 <= arr.length <= 10^5
1 <= arr[i] <= 10^6
arr contains distinct integers.
1 <= k <= 10^9

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "from collections import deque\n\nclass Solution:\n    def getWinner(self, arr: List[int], k: int) -> int:\n        # winner remains at position 0 \n        # loser moves to end of array \n        '''\n        arr = [2,1,3,5,4,6,7]\n        k = 2 \n        \n        [2,3,5,4,6,7,1]\n        [3,5,4,6,7,1,2]\n        [5,4,]\n        \n        question - if no rotation - first number\n        1) indicator that number geq than prev number\n        2) consecutive numbers greater than \n        is >= k\n        \n        otherwise \n        1) same - with each integer at beginning; count the sum of consecutive elements it's greater than from index [i - 1], [min(len(i) - 1,i + k)]\n        \n        otherwise \n        1) if len is less than (k), then we have to loop through; \n        \n        any better way of doing this?\n        this way will be O(k*n) - constant\n        \n        question - what's the best way to shift array? (pop? append)\n        queue? i need to remove either top or second top element\n        swap first and second, dequeue \n\n        '''\n        \n#         if len(arr) < 3:\n#             return min(arr)\n        \n        \n#         q = deque(arr[::-1])\n#         # append on right\n#         # dequeue on left\n#         count = 0\n#         while(count < k):\n#             comp1, comp2 = arr[-1], arr[-2]\n#             #   if new winner\n#             if comp2 > comp1: \n#                 arr.append(arr.pop())\n#                 count = 1\n#             else:\n#             # if current winner\n#                 arr[-1] = comp2\n#                 arr[-2] = comp1\n#                 arr.append(arr.pop())\n#                 count += 1\n            \n#         return arr[-1]\n\n    \n        count = 0\n    #     [2,1,3]\n        current = arr[0]\n        for i in range(1, len(arr)):\n            if count >= k:\n                return current\n            elif arr[i] > current:\n                current = arr[i]\n                count = 1\n            else:\n                count += 1\n        return current\n\n        \n            \n                        \n\n\n#     i need to know how many  smaller elements there will be after each \n# sort? keep track of sorted indices? \n# i only care about what's immediately before it, and next term that is largest \n# after first round, it's sorted in asc order - if it doesn't win the first itme it appears, it won't win \n# idea - for each - keep number which are greater than it k*n\n# idea - sort all (nlogn) and for each, check how many after it are less than it; \n# if a bigger number comes before a smaller one and will win, it will win for sure\n# if a smaller numnber comes before a bigger number, if it hasn't won it won't win \n    # if k < sz this is fine \n    # otherwise\n    # if we get to the end, the largest number is the winner\n\n\n\n\n\n\n\n\n\n            \n            \n            \n"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'getWinner'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 5426