output_description: Print the K-th smallest integer in the array after the N operations.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
      a_1 b_1
      :  
      a_N b_N
attempt: import math
  import sys
  
  
  def getinputdata():
  
      # 配列初期化
      array_result = []
  
      data = input()
  
      array_result.append(data.split(" "))
  
      flg = 1
  
      try:
  
          while flg:
  
              data = input()
  
              array_temp = []
  
              if data != "":
  
                  array_result.append(data.split(" "))
  
                  flg = 1
  
              else:
  
                  flg = 0
      finally:
  
          return array_result
  
  
  arr_data = getinputdata()
  
  # 回数
  n = int(arr_data[0][0])
  
  # 番目
  k = int(arr_data[0][1])
  
  s = ""
  
  mysum = 0
  
  for i in range(1, 1 + n):
  
      cnt = int(arr_data[i][1])
      j = arr_data[i][0]
  
      #    print(mysum)
  
      if k <= mysum + cnt:
  
          #        arr=[j]*cnt
  
          #        print(k,mysum,arr)
  
          print(j)
  
          break
  
      else:
  
          mysum += cnt
  
problem_description: 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.
samples: [{"input": "3 4\n    1 1\n    2 2\n    3 3", "output": "3\n    \n\nThe resulting array is the same as the one in the problem statement.\n\n* * *"}, {"input": "10 500000\n    1 100000\n    1 100000\n    1 100000\n    1 100000\n    1 100000\n    100000 100000\n    100000 100000\n    100000 100000\n    100000 100000\n    100000 100000", "output": "1"}]