bigarray Batch , stdin/stdout

Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

statement.html

Problem Description

There is an empty array. The following $N$ operations will be performed to insert integers into the array. In the $i$ -th operation $(1 \leq i \leq 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$ .

Input

The first line of the input will contain 2 integers, $N$ and $K$ .

Then $N$ lines with 2 integers will follow, the i-th line will contain 2 integers, $a_{i}$ and $b_{i}$ .

Output

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

Limits

$2 \leq | S | \leq 100$
$| S | = | T |$ $S$ $2 \leq | S | \leq 100$
$| S | = | T |$
$| S | = | T |$

Subtask 1 (31%): $| S | = | T |$ = 1.

Subtask 2 (69%): No additional constraints.

Subtask 3 (0%): Sample test cases.

Sample Input 1

Sample Output 1

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

Subtasks and Limits

Subtask	Score	#TC	Time	Memory	Scoring
1	31	7	1s	256MB	Minimum
2	69	17	1s	256MB	Minimum
3	0	2	1s	256MB	Minimum

Judge Compile Command

g++-8 ans.cpp -o bigarray -Wall -Wshadow -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512