{"problem":{"name":"Big Array","description":{"content":"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 ar","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc061_c"},"statements":[{"statement_type":"Markdown","content":"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$.\n\n## Constraints\n\n*   $1≤N≤10^5$\n*   $1≤a_i,b_i≤10^5$\n*   $1≤K≤b_1…+…b_N$\n*   All input values are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n$a_1$ $b_1$\n$:$  \n$a_N$ $b_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc061_c","tags":[],"sample_group":[["3 4\n1 1\n2 2\n3 3","3\n\nThe resulting array is the same as the one in the problem statement."],["10 500000\n1 100000\n1 100000\n1 100000\n1 100000\n1 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000\n100000 100000","1"]],"created_at":"2026-03-03 11:01:14"}}