Implementation: Data Structures
Big array of Dino
Once, when Dino was solving a problem related to arrays, he saw that the size of all arrays is at most
106. Since Dino is a dinosaur, this number seemed very small to him. Therefore, he decided to create a big array.
Dino first creates an empty array and selects n pairs of numbers: (
b2), ..., (
bn). Then for each of these pairs he inserts into array the number
bi ai times. For example,if the first pair is (3, 5), the number 5 will be inserted into array 3 times. After that, Dino decides to arrange this array in non-decreasing order, but since the array is very large, Dino's computer cannot perform this arrangement. He is interested in the k-th (the array is numbered starting from 1) number. Help Dino to find this number.
First line contains number n (1 ≤ n ≤
105). Each of the next n lines contains pair (
bi) (1 ≤
105). The last line contains number k. It is guaranteed that k-th number exists in array.
Print the k-th number in non-decreasing array.
3 1 2 3 6 2 1 3