Problem:
Score : 300 points

Problem Statement

There is an empty array.
The following N operations will be performed to insert integers into the array.
In the i-th operation (1≤i≤N), b_i copies of an integer a_i are inserted into the array.
Find the K-th smallest integer in the array after the N operations.
For example, the 4-th smallest integer in the array \{1,2,2,3,3,3\} is 3.

Constraints

1≤N≤10^5

1≤a_i,b_i≤10^5

1≤K≤b_1…+…b_n

All input values are integers.

Input

Input is given from Standard Input in the following format:

N K
a_1 b_1
:
a_N b_N

Output

Print the K-th smallest integer in the array after the N operations.

Sample Input 1

3 4
1 1
2 2
3 3

Sample Output 1

3

The resulting array is the same as the one in the problem statement.

Sample Input 2

10 500000
1 100000
1 100000
1 100000
1 100000
1 100000
100000 100000
100000 100000
100000 100000
100000 100000
100000 100000

Sample Output 2

1

Solution in Go (1.14.1) (judge verdict: Accepted)

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func nextInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

var sc = bufio.NewScanner(os.Stdin)

func main() {
	// Code for C - Big Array
	var N, K int
	fmt.Scan(&N, &K)

	sc.Split(bufio.ScanWords)
	var a, b int
	c := make(map[int]int, N)
	for i := 0; i < N; i++ {
		a, b = nextInt(), nextInt()
		c[a] += b
	}

	A := make([]int, 0)
	for i := range c {
		A = append(A, i)
	}

	sort.Sort(sort.IntSlice(A))
	var count int
	for i := 0; i < len(A); i++ {
		//fmt.Println(count, A[i], c[A[i]])
		count += c[A[i]]
		if K <= count {
			fmt.Println(A[i])
			break
		}
	}
}