Super Easy Python Solution
\nfrom itertools import accumulate\nimport bisect \n\nclass RLEIterator:\n\n    def __init__(self, A: List[int]):\n        self.count = A[::2]\n        self.val
```\nfrom itertools import accumulate\nimport bisect \n\nclass RLEIterator:\n\n    def __init__(self, A: List[int]):\n        self.count = A[::2]\n        self.value = A[1::2]\n        self.start = -1\n        self.acc  = list(accumulate(self.count))\n        \n\n    def next(self, n: int) -> int:\n        self.start += n\n        index = bisect.bisect(self.acc, self.start)\n        if index >= len(self.count):\n            return -1\n        return self.value[index]\n```
[]