Python Binary Search Solution, beats 100% 
``` class RLEIterator: def __init__(self, A):     """     :type A: List[int]     """     cnt = 0     self.index, self.value = list(), list()     for num, i in z
```
class RLEIterator:

    def __init__(self, A):
        """
        :type A: List[int]
        """
        cnt = 0
        self.index, self.value = list(), list()
        for num, i in zip(A[::2], A[1::2]):
            if num == 0:
                continue
            cnt += num
            self.index.append(cnt)
            self.value.append(i)
        self.indicator = 0
        self.size = cnt
		
    def next(self, n):
        """
        :type n: int
        :rtype: int
        """
        self.indicator += n
        if self.indicator >= self.size:
            return -1
        ind = bisect.bisect_left(self.index, self.indicator)
        return self.value[ind]

```
[]