input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, K = list(map(int, input().split()))
a_b = [list(input().split()) for i in range(N)]
big_array = []
for i in range(N):
big_array += [a_b[i][0]] * int(a_b[i][1])
print((sorted(big_array)[K-1]))
| N, K = list(map(int, input().split()))
a_b = [list(map(int, input().split())) for i in range(N)]
a_b.sort()
index = 0
for i in range(N):
index += a_b[i][1]
if index >= K:
print((a_b[i][0]))
exit() | p03721 |
n, k = list(map(int, input().split()))
array = []
for i in range(n):
a, b = list(map(int, input().split()))
array.extend([a for _ in range(b)])
array.sort()
print((array[k-1]))
| n, k = list(map(int, input().split()))
x = [0 for _ in range(0, 100001)]
for i in range(n):
a, b = list(map(int, input().split()))
x[a] += b
l = 0
for i in range(1, 100001):
if (l < k and (l + x[i]) >= k ):
print(i)
exit()
l += x[i]
| p03721 |
n,k=list(map(int,input().split()))
listn=[]
for a in range(n):
b,c=list(map(int,input().split()))
listn+=[b]*c
listn.sort()
print((listn[k-1])) | class Number:
def __init__(self,number,qty):
self.qty=qty
self.number=number
n,k=list(map(int,input().split()))
listn=[]
for a in range(n):
b,c=list(map(int,input().split()))
listn.append(Number(b,c))
listn.sort(key=lambda x:x.number)
count=k
for a in listn:
if a.qty>=count:
print((a.number))
break
else:
count-=a.qty
| p03721 |
f = lambda: list(map(int,input().split()))
f_ = lambda: [int(x)-1 for x in input().split()]
n,k = f()
l = []
for _ in range(n):
a,b = f()
l += [a]*b
print((sorted(l)[k-1])) | f = lambda: list(map(int,input().split()))
f_ = lambda: [int(x)-1 for x in input().split()]
n,k = f()
d = []
for _ in range(n):
a,b = f()
d.append((a,b))
d.sort(key=lambda x: x[0])
count = 0
for x,y in d:
count += y
if count >= k:
break
print(x) | p03721 |
n, k = list(map(int, input().split()))
a = []
b = []
for _ in range(n):
ta, tb = list(map(int, input().split()))
a.append(ta)
b.append(tb)
ret = []
tb = 0
i = 0
for i in range(n):
ret.extend([a[i]] * b[i])
ret = sorted(ret)
print((ret[k-1])) | n, k = list(map(int, input().split()))
items = dict()
for _ in range(n):
ta, tb = list(map(int, input().split()))
if ta in list(items.keys()):
items[ta] += tb
else:
items[ta] = tb
items = sorted(items.items())
tb = 0
key = 0
for key, val in items:
tb += val
if tb >= k:
break
print(key) | p03721 |
N, K = [int(x) for x in input().split()]
array = []
for i in range(N):
a, b = [int(x) for x in input().split()]
array.extend([a for x in range(b)])
array.sort()
print((array[K-1]))
| N, K = [int(x) for x in input().split()]
array = []
count = 0
for i in range(N):
array.append(tuple(map(int, input().split())))
array.sort()
K -= 1
for tup in array:
if K < tup[1]:
print((tup[0]))
break
else:
K -= tup[1] | p03721 |
#-*- coding: utf-8 -*-
n, k = list(map(int, input().split()))
src = []
for i in range(n):
src.append(list(map(int, input().split())))
src.sort(key=lambda x:x[0]) # 0番目の要素でソート
data = []
for a, b in src:
for i in range(b):
data.append(a)
print(data[k-1]) | #-*- coding: utf-8 -*-
def get_ans():
n, k = list(map(int, input().split()))
src = []
for i in range(n):
src.append(list(map(int, input().split())))
src.sort(key=lambda x:x[0]) # 0番目の要素でソート
cnt = 0
for a, b in src:
cnt = cnt + b
if cnt >= k:
return a
break
return src[n-1][1]
if __name__ == '__main__':
print(get_ans())
| p03721 |
n, k = list(map(int, input().split()))
A = []
for i in range(n):
a, b = list(map(int, input().split()))
B = [a] * b
A.extend(B)
A = sorted(A)
print((A[k-1])) | n, k = list(map(int, input().split()))
A = []
B = []
for i in range(n):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
C = list(zip(A, B))
C = sorted(C)
A, B = list(zip(*C))
for i in range(n):
a = A[i]
b = B[i]
k -= b
if k <= 0:
print(a)
break | p03721 |
N,K = list(map(int,input().split()))
array = []
for i in range(N):
a,b = list(map(int,input().split()))
for i in range(b):
array.append(a)
array.sort()
print((array[K-1])) | N,K = list(map(int,input().split()))
array = []
sum = 0
for i in range(N):
a,b = list(map(int,input().split()))
array.append([a,b])
array.sort(key = lambda x:x[0])
for i in range(N):
sum += array[i][1]
if sum >= K:
print((array[i][0]))
exit() | p03721 |
N,K=list(map(int,input().split()))
a=[]
for i in range(N):
b,c=list(map(int,input().split()))
for j in range(c):
a.append(b)
a.sort()
print((a[K-1]))
| N,K=list(map(int,input().split()))
a=[]*N
b=0
for i in range(N):
a.append(list(map(int,input().split())))
a.sort()
for i in range(N):
b+=a[i][1]
if b>=K:
print((a[i][0]))
exit() | p03721 |
n, k = list(map(int, input().split()))
arr = []
for i in range(n):
a = list(map(int, input().split()))
for j in range(a[1]):
arr.append(a[0])
arr.sort()
print((arr[k - 1])) | n, k = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(n)]
ab.sort(key=lambda x: x[0])
index = 0
for i in range(n):
index += ab[i][1]
if index >= k:
ans = ab[i][0]
break
print(ans) | p03721 |
N, K = list(map(int, input().split()))
A = []
for _ in range(N):
a, b = list(map(int, input().split()))
A += [a]*b
A.sort()
print((A[K-1])) | N, K = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
AB = sorted(AB, key=lambda x:x[0])
total = 0
for a, b in AB:
total += b
if total >= K:
print(a)
exit() | p03721 |
n, k = list(map(int, input().split()))
a = []
b = []
for i in range(n):
a_, b_ = list(map(int, input().split()))
a.append(a_)
b.append(b_)
res = []
for i in range(n):
for _ in range(b[i]):
res.append(a[i])
#print(res)
res.sort()
#print(res)
print((res[k-1])) | n, k = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
#print(ab)
ab.sort()
#print(ab)
for i in range(n):
k = k-ab[i][1]
if k <= 0:
print((ab[i][0]))
exit() | p03721 |
n,k = list(map(int,input().split()))
ls = []
for i in range(n):
a,b = [int(i) for i in input().split()]
tmp = [a] * b
ls.append(tmp)
ls = sum(ls,[])
ls.sort()
print((ls[k-1])) | n,k = list(map(int,input().split()))
ls = []
b_num = 0
for i in range(n):
a,b = [int(i) for i in input().split()]
if b_num <= k:
tmp = [a] * b
ls.extend(tmp)
ls.sort()
b_num += b
else:
if(a <= ls[-1]):
tmp = [a] * b
ls.extend(tmp)
ls.sort()
print((ls[k-1])) | p03721 |
n,k = list(map(int,input().split()))
ls = []
b_num = 0
for i in range(n):
a,b = [int(i) for i in input().split()]
if b_num < k:
tmp = [a] * b
ls.extend(tmp)
#ls.sort()
b_num += b
else:
if(a <= max(ls)):
tmp = [a] * b
ls.extend(tmp)
ls.sort()
print((ls[k-1])) | n,k = list(map(int,input().split()))
ls = []
for i in range(n):
a,b = [int(i) for i in input().split()]
ls.append([a,b])
ls.sort()
for a,b in ls:
if b >= k:
print(a)
break
else:
k -= b | p03721 |
def resolve():
'''
code here
'''
N, K = [int(item) for item in input().split()]
queries = [[int(item) for item in input().split()] for _ in range(N)]
queries.sort(key=lambda x:x[0])
que = []
cnt = 0
for num, val in queries:
que += [num]*val
cnt += val
if cnt >= K:
break
print((que[K-1]))
if __name__ == "__main__":
resolve()
| def resolve():
'''
code here
'''
N, K = [int(item) for item in input().split()]
queries = [[int(item) for item in input().split()] for _ in range(N)]
queries.sort(key=lambda x:x[0])
temp_que = []
for num, val in queries:
temp_que = [num]*val
K -= val
if K <= 0:
break
print((temp_que[K-1]))
if __name__ == "__main__":
resolve()
| p03721 |
def resolve():
'''
code here
'''
N, K = [int(item) for item in input().split()]
queries = [[int(item) for item in input().split()] for _ in range(N)]
queries.sort(key=lambda x:x[0])
temp_que = []
for num, val in queries:
temp_que = [num]*val
K -= val
if K <= 0:
break
print((temp_que[K-1]))
if __name__ == "__main__":
resolve()
| def resolve():
'''
code here
'''
N, K = [int(item) for item in input().split()]
queries = [[int(item) for item in input().split()] for _ in range(N)]
queries.sort(key=lambda x:x[0])
temp_que = []
for num, val in queries:
temp_que = num
K -= val
if K <= 0:
break
print(temp_que)
if __name__ == "__main__":
resolve()
| p03721 |
n, k = list(map(int, input().split()))
L = []
for i in range(n):
a, b = list(map(int, input().split()))
for j in range(b):
L.append(a)
L.sort()
print((L[k-1])) | n, k = list(map(int, input().split()))
L = [0]*(pow(10,5)+1)
for i in range(n):
a, b = list(map(int, input().split()))
L[a] += b
s = 0
for i in range(pow(10,5)+1):
s += L[i]
if s >= k:
print(i)
break
| p03721 |
n,k = list(map(int,input().split()))
num = 0
q = []
for i in range(n):
a,b = list(map(int,input().split()))
q.append((a,b))
q.sort()
for i in range(n):
a, b = q[i][0], q[i][1]
num += b
if num >= k:
print(a)
exit()
| n,k = list(map(int,input().split()))
cnt = 0
num = []
for i in range(n):
a,b = list(map(int,input().split()))
num.append((a,b))
num.sort()
for i in range(n):
cnt += num[i][1]
if cnt >= k:
print((num[i][0]))
exit() | p03721 |
N, K = list(map(int, input().split()))
l = []
for i in range(N):
a, b = list(map(int, input().split()))
l.extend([a] * b)
print((sorted(l)[K-1])) | N, K = list(map(int, input().split()))
l = [0] * 10 ** 5
for i in range(N):
a, b = list(map(int, input().split()))
l[a-1] += b
count = 0
for j in range(10**5):
count += l[j]
if count >= K:
print((j+1))
break
| p03721 |
N, K = list(map(int, input().split()))
big_array = list()
for _ in range(N):
a, b = list(map(int, input().split()))
big_array += [a]*b
big_array.sort()
print((big_array[K-1]))
| N, K = list(map(int, input().split()))
val_dict = dict()
for _ in range(N):
a, b = list(map(int, input().split()))
val_dict[a] = val_dict.get(a, 0) + b
val_keys = sorted(val_dict.keys())
K_rest = K
for key in val_keys:
K_rest -= val_dict[key]
if K_rest <= 0:
print(key)
break
| p03721 |
def bakt():
len_s = [0 for _ in range(int(1e+5+1))]
ans = 0
N, K = list(map(int, input().split()))
for _ in range(N):
a, b = list(map(int, input().split()))
len_s[a] += b
len_a = 0
for i, j in enumerate(len_s):
len_a += j
if len_a >= K and ans == 0:
ans = i
print(ans)
if __name__ == '__main__':
bakt() | def bakt():
len_s = [0]*int(1e+5+1)
N, K = list(map(int, input().split()))
for _ in range(N):
a, b = list(map(int, input().split()))
len_s[a] += b
len_a = 0
for i, j in enumerate(len_s):
len_a += j
if len_a >= K:
print(i)
break
if __name__ == '__main__':
bakt()
| p03721 |
from itertools import accumulate
from bisect import bisect_left
N, K = [int(i) for i in input().split()]
memo = [0] * 100010
for _ in range(N):
a, b = [int(i) for i in input().split()]
memo[a] += b
print((bisect_left(list(accumulate(memo)), K))) | from sys import stdin
input = stdin.readline
from itertools import accumulate
from bisect import bisect_left
N, K = [int(i) for i in input().split()]
memo = [0] * 100010
for _ in range(N):
a, b = [int(i) for i in input().split()]
memo[a] += b
print((bisect_left(list(accumulate(memo)), K))) | p03721 |
from sys import stdin
input = stdin.readline
from itertools import accumulate
from bisect import bisect_left
N, K = [int(i) for i in input().split()]
memo = [0] * 100010
for _ in range(N):
a, b = [int(i) for i in input().split()]
memo[a] += b
print((bisect_left(list(accumulate(memo)), K))) | from sys import stdin
input = stdin.readline
from itertools import accumulate
from bisect import bisect_left
N, K = list(map(int, input().split()))
memo = [0] * 100010
for _ in range(N):
a, b = list(map(int, input().split()))
memo[a] += b
print((bisect_left(list(accumulate(memo)), K))) | p03721 |
line_one = input().split()
n = int(line_one[0])
k = int(line_one[1])
l = []
#d = {}
for i in range(n):
line_one2 = input().split()
a1 = int(line_one2[0])
b1 = int(line_one2[1])
if a1 in l:
#d[a1] += b1
l[a1][1] += b1
else:
l.append( ( a1, b1 ))
#//d[a1] = b1
l.sort()
count = 0
for item in l:
count += item[1]
if k <= count:
print(item[0])
break
| line_one = input().split()
n = int(line_one[0])
k = int(line_one[1])
l = []
#d = {}
for i in range(n):
line_one2 = input().split()
a1 = int(line_one2[0])
b1 = int(line_one2[1])
l.append( ( a1, b1 ))
#if a1 in l:
# #d[a1] += b1
# l[a1][1] += b1
#else:
# l.append( ( a1, b1 ))
# #//d[a1] = b1
#l.sort()
l = sorted(l, key=lambda x: x[0])
count = 0
for item in l:
count += item[1]
if k <= count:
print(item[0])
break
| p03721 |
import heapq
n, k = list(map(int,input().split()))
q = []
for i in range(n):
q.append(list(map(int, input().split())))
heapq.heapify(q)
cnt = 0
while cnt < k:
a, b = heapq.heappop(q)
cnt += b
print(a) | n, k = list(map(int,input().split()))
q = []
for i in range(n):
q.append(list(map(int, input().split())))
q = sorted(q, key=lambda x:x[0])
cnt = 0
i = 0
while cnt < k:
a, b = q[i]
cnt += b
i += 1
print(a) | p03721 |
N, K = list(map(int,input().split()))
A = sorted([list(map(int,input().split())) for k in range(N)])
for a in A:
K -= a[1]
if K <= 0:
print((a[0]))
exit(0) | N, K = list(map(int,input().split()))
L = sorted([list(map(int,input().split())) for _ in range(N)])
for e in L:
K -= e[1]
if K <= 0:
print((e[0]))
exit(0)
| p03721 |
N, K = list(map(int,input().split()))
L = sorted([list(map(int,input().split())) for _ in range(N)])
for e in L:
K -= e[1]
if K <= 0:
print((e[0]))
exit(0)
| N, K = list(map(int,input().split()))
L = []
for k in range(N):
L.append(list(map(int,input().split())))
L = sorted(L)
for e in L:
K -= e[1]
if K <= 0:
print((e[0]))
exit(0)
| p03721 |
n,k=(int(i) for i in input().split())
a=[[int(i) for i in input().split()] for i in range(n)]
#print(a)
ans=0
while ans < k:
mina=min(a)
# print(a)
a.remove(mina)
ans+=mina[1]
print((mina[0]))
| n,k=(int(i) for i in input().split())
a=[[int(i) for i in input().split()] for i in range(n)]
#print(a)
a.sort()
i=0
ans=0
while ans < k:
ans+=a[i][1]
i+=1
print((a[i-1][0]))
| p03721 |
import heapq
N,K=list(map(int,input().split()))
c=[]
for i in range(N):
a,b=list(map(int,input().split()))
for j in range(b):
heapq.heappush(c,a)
for i in range(len(c)):
val=heapq.heappop(c)
if i==K-1:
print(val)
break
| import heapq
N,K=list(map(int,input().split()))
c=[]
for i in range(N):
heapq.heappush(c, tuple( map(int,input().split()) ) )
cnt=0
for i in range(len(c)):
val=heapq.heappop(c)
cnt+=val[1]
if K<=cnt:
print(val[0])
break | p03721 |
a=[];n,k=list(map(int,input().split()))
for _ in[0]*n:
b,c=list(map(int,input().split()))
a+=[b]*c
print((sorted(a)[~-k])) | a=[];n,k=list(map(int,input().split()))
for _ in[0]*n:a+=[list(map(int,input().split()))]
a.sort();i=0
while k>0:k-=a[i][1];i+=1
print((a[~-i][0])) | p03721 |
a=[];n,k=list(map(int,input().split()))
for _ in[0]*n:a+=[list(map(int,input().split()))]
a.sort();i=0
while k>0:k-=a[i][1];i+=1
print((a[~-i][0])) | n,k=list(map(int,input().split()));i=0
a=sorted(list(map(int,input().split()))for _ in[0]*n)
while k>0:k-=a[i][1];i+=1
print((a[~-i][0])) | p03721 |
n,k=list(map(int,input().split()))
arr=[]
for i in range(n):
a,b=list(map(int,input().split()))
for j in range(b):
arr.append(a)
arr.sort()
print((arr[k-1])) | n,k=list(map(int,input().split()))
nums=[]
for i in range(n):
nums.append(list(map(int,input().split())))
nums.sort(key=lambda x:x[0])
cnt=0
i=0
while cnt<k:
cnt+=nums[i][1]
if cnt>=k:
print((nums[i][0]))
break
i+=1 | p03721 |
N, K = list(map(int, input().split()))
L = []
for i in range(N):
a, b = list(map(int, input().split()))
for j in range(b):
L.append(a)
L = sorted(L)
print((L[K - 1])) | N, K = list(map(int, input().split()))
L = []
for i in range(100000):
L.append(0)
for i in range(N):
a, b = list(map(int, input().split()))
L[a - 1] += b
sm = 0
for i in range(100000):
sm += L[i]
if sm >= K:
print((i + 1))
break | p03721 |
N, K = list(map(int, input().split()))
an = []
for i in range(N):
a, b = list(map(int, input().split()))
for j in range(b):
an.append(a)
an.sort()
ans = an[K-1]
print(ans) | N, K = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(N)]
a.sort()
ans = a[0][0]
b = a[0][1]
i = 1
while b < K:
ans = a[i][0]
b += a[i][1]
i += 1
print(ans)
| p03721 |
N,K = [int(i) for i in input().split()]
list = []
for i in range(N):
a,b = [int(i) for i in input().split()]
for _ in range(b):
list.append(a)
list.sort()
print((list[K-1]))
| N,K = [int(i) for i in input().split()]
dic = {}
sum = 0
for i in range(N):
a,b = [int(i) for i in input().split()]
if a in dic:
dic[a] += b
else:
dic[a] = b
dic = sorted(dic.items())
for i in range(len(dic)):
sum += dic[i][1]
if K <= sum:
print((dic[i][0]))
break
| p03721 |
N, K = list(map(int, input().split()))
A = []
for _ in range(N):
a, b = list(map(int, input().split()))
A += [a] * b
A.sort()
print((A[K-1]))
| N, K = list(map(int, input().split()))
AB = list(list(map(int, input().split())) for _ in range(N))
AB.sort()
if AB[0][1] >= K:
ans = AB[0][0]
else:
for i in range(1,N):
AB[i][1] += AB[i-1][1]
if AB[i][1] >= K:
ans = AB[i][0]
break
print(ans)
| p03721 |
n,k=list(map(int,input().split()))
l=[]
for i in range(n):
a,b=list(map(int, input().split()))
l.append([a]*b)
ll=[]
for i in l:
for j in i:
ll.append(j)
ll=sorted(ll)
print((ll[k-1]))
| n,k=list(map(int,input().split()))
li = [list(map(int, input().split())) for i in range(n)]
li.sort()
c=0
for i in range(n):
c+=li[i][1]
if c>=k:
print((li[i][0]))
break
| p03721 |
N,K = [int(x) for x in input().split()]
arr=[]
for i in range(N):
a,b = [int(x) for x in input().split()]
arr = arr + [a]*b
arr.sort()
print((arr[K-1]))
| N,K = [int(x) for x in input().split()]
arr=[]
for i in range(N):
arr.append([int(x) for x in input().split()])
arr.sort(key=lambda tup: tup[0])
for i in range(N):
K=K-arr[i][1]
if K<=0:
print((arr[i][0]))
break
| p03721 |
def main():
l = []
N, K = list(map(int, input().split()))
for i in range(N):
a, b = list(map(int, input().split()))
l.extend([a for j in range(b)])
l = sorted(l)
print((l[K-1]))
main() | def main():
l = []
N, K = list(map(int, input().split()))
d_num = {i: 0 for i in range(100002)}
for i in range(N):
a, b = list(map(int, input().split()))
d_num[a] = d_num[a] + b
for i in range(100002):
K = K - d_num[i+1]
if K <= 0:
break
print((i+1))
main() | p03721 |
N, K = list(map(int, input().split()))
numList = []
for _ in range(N):
a, b = list(map(int, input().split()))
for _ in range(b):
numList.append(a)
numList.sort()
print((numList[K-1])) | N, K = list(map(int, input().split()))
numList = []
for _ in range(N):
numList.append(list(map(int, input().split())))
numList.sort(key=lambda x:x[0])
idx = 0
while True:
K = K - numList[idx][1]
if K <= 0:
print((numList[idx][0]))
exit()
idx = idx + 1 | p03721 |
N, K = [int(i) for i in input().split()]
ans = []
for i in range(N):
A,B = [int(i) for i in input().split()]
for b in range(B):
ans.append(A)
ans.sort()
print((ans[K-1]))
| N, K = [int(i) for i in input().split()]
ans = []
A = [[]*2]*N
num = 0
for i in range(N):
A[i] = [int(i) for i in input().split()]
A.sort()
i = 0
while num < K:
num += A[i][1]
i += 1
print((A[i-1][0])) | p03721 |
import sys
N,K=list(map(int, input().split()))
p=[]
for i in range (0,N):
r=list(map(int, input().split() ))
p.append(r)
p.sort()
q=[]
for i in range(0,N):
q+=[p[i][0]]*p[i][1]
if len(q)>K:
print((q[K-1]))
sys.exit() | import sys
N,K=list(map(int, input().split()))
p=[]
for i in range (0,N):
r=list(map(int, input().split() ))
p.append(r)
p.sort()
k=0
for i in range(0,N):
k+=p[i][1]
if k>=K:
print((p[i][0]))
sys.exit() | p03721 |
import sys
N,K=list(map(int,input().split()))
nums = []
for _ in range(N):
a,b = list(map(int,sys.stdin.readline().split()))
nums += [a for _ in range(b)]
nums.sort()
print((nums[K-1])) | import sys
N,K=list(map(int,input().split()))
nums = {}
for _ in range(N):
a,b = list(map(int,sys.stdin.readline().split()))
if a in nums:
nums[a] += b
else:
nums[a] = b
cnt = 0
for key in sorted(nums.keys()):
cnt += nums[key]
if cnt >= K:
print(key)
exit() | p03721 |
N, K = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
A.sort()
for i in range(N):
if K>A[i][1]:
K -= A[i][1]
else:
ans = A[i][0]
break
print(ans) | def solve():
ans = 0
cnt = 0
N, K = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
A.sort()
for a,b in A:
cnt += b
if cnt>=K:
ans = a
break
return ans
print((solve())) | p03721 |
import sys
input = sys.stdin.readline
def two_int():
N, K = list(map(int, input().split()))
return N,K
def one_int():
return int(eval(input()))
def one_str():
return eval(input())
def many_int():
return list(map(int, input().split()))
from collections import defaultdict
N,K = two_int()
query = []
for i in range(N):
query.append(two_int() )
query = sorted(query, key=lambda x: x[0])
dicts = defaultdict(int)
count = 0
sums = 0
for [a,b] in query:
temp = 0
for k,v in list(dicts.items()):
if k>a:
dicts[k] += b
if temp <= k <= a:
temp = k
dicts[a] = b+dicts[temp]
sums += b
if sums > K:
break
output = [ [k,v] for k,v in list(dicts.items())]
temp = sorted(output, key=lambda x: x[0])
ans=0
for i in range(len(temp)-1):
if temp[i][1] < K <= temp[i+1][1]:
ans=temp[i+1][0]
break
print(ans) | import sys
input = sys.stdin.readline
def two_int():
N, K = list(map(int, input().split()))
return N,K
def one_int():
return int(eval(input()))
def one_str():
return eval(input())
def many_int():
return list(map(int, input().split()))
from collections import defaultdict
N,K = two_int()
query = []
for i in range(N):
query.append(two_int() )
query = sorted(query, key=lambda x: x[0])
ans=0
sums=0
for q in query:
if sums < K <= sums+q[1]:
ans=q[0]
break
sums += q[1]
print(ans)
| p03721 |
N, K = list(map(int, input().split()))
buff = []
a = []
b = []
for i in range(N):
_a, _b = list(map(int, input().split()))
a.append(_a)
b.append(_b)
buff += [_a]*_b
buff = sorted(buff)
print((buff[K-1]))
| N, K = list(map(int, input().split()))
buff = []
a = []
for i in range(N):
_a, _b = list(map(int, input().split()))
buff += [_a]*_b
buff = sorted(buff)
print((buff[K-1]))
| p03721 |
N, K = list(map(int, input().split()))
buff = []
a = []
ans = 0
b = 0
for i in range(N):
_a, _b = list(map(int, input().split()))
b += _b
a.append((_a, _b))
# if b >= K and ans == 0:
# ans = _a
# buff += [_a]*_b
a = sorted(a)
for i in range(N):
buff += [a[i][0]] * a[i][1]
# buff = sorted(buff)
print((buff[K-1]))
# print(ans)
| amax = 100000
cnt = [0 for i in range(amax+1)]
N, K = list(map(int, input().split()))
for i in range(N):
a, b = list(map(int, input().split()))
cnt[a] += b
for ans in range(1, amax+1):
if K <= cnt[ans]:
print(ans)
break
K -= cnt[ans] | p03721 |
N,K = list(map(int,input().split()))
ab = [list(map(int,input().split())) for _ in range(N)]
L = []
for i in range(N):
L += [ab[i][0]] * ab[i][1]
L.sort()
print((L[K-1]))
| N,K = list(map(int,input().split()))
ab = [list(map(int,input().split())) for _ in range(N)]
ab.sort(key = lambda x:x[0])
idx = 0
i = 0
while True:
if idx + ab[i][1] > K-1:
ans = ab[i][0]
break
else:
idx += ab[i][1]
i += 1
print(ans)
| p03721 |
n, k = list(map(int, input().split()))
li = []
for i in range(n):
a, b = list(map(int, input().split()))
for j in range(b):
li.append(a)
li.sort()
print((li[k-1])) | n, k = list(map(int, input().split()))
li = []
for i in range(n):
temp = list(map(int, input().split()))
li.append(temp)
#print(li)
li.sort()
#print(li)
total=0
for i in range(n):
if i==n-1:
#print("here")
print((li[i][0]))
break
total+=li[i][1]
if total<k:
continue
else:
print((li[i][0]))
break
#print(i, total) | p03721 |
from collections import Counter
n, k = list(map(int, input().split()))
c = Counter()
for _ in range(n):
a, b = list(map(int, input().split()))
c[a] += b
c = sorted(list(c.items()), key=lambda x: x[0])
for i, v in c:
k -= v
if k <= 0:
print(i)
exit() | N, K = list(map(int, input().split()))
bucket = [0] * (10 ** 5 + 1)
for _ in range(N):
a, b = list(map(int, input().split()))
bucket[a] += b
cnt = 0
for i, c in enumerate(bucket):
if c == 0:
continue
cnt += c
if cnt >= K:
print(i)
exit() | p03721 |
n,k = list(map(int, input().split()))
ret = []
for i in range(n):
a,b = list(map(int, input().split()))
ret += [a] * b
ret.sort()
print((ret[k-1]))
| n,k = list(map(int, input().split()))
ret = {}
for i in range(n):
a,b = list(map(int, input().split()))
ret[a] = ret.get(a, 0) + b
for i in sorted(ret.keys()):
k -= ret[i]
if k <= 0:
print(i)
break | p03721 |
N,K = list(map(int,input().split()))
tmp=[]
for i in range(N):
a_i,b_i=list(map(int,input().split()))
tmp += [a_i]*b_i
tmp.sort()
print((tmp[K-1])) | N,K = list(map(int,input().split()))
tmp=[]
for i in range(N):
a_i,b_i=list(map(int,input().split()))
tmp.append([a_i,b_i])
tmp.sort(key=lambda x:x[0])
for t in tmp:
K -= t[1]
if K<=0:
print((t[0]))
break | p03721 |
#ABC061C
N, K = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(N)]
ans = []
for i in range(N):
for _ in range(ab[i][1]):
ans.append(ab[i][0])
ans.sort()
print((ans[K-1])) | #ABC061C
import sys
N, K = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(N)]
now = 0
ab.sort()
for a, b in ab:
now += b
if now >= K:
print(a)
sys.exit() | p03721 |
from sys import exit, stdin
N, K = [int(_) for _ in stdin.readline().rstrip().split()]
AB = []
for i in range(N):
a, b = stdin.readline().rstrip().split()
for j in range(int(b)):
AB.append(int(a))
AB.sort()
print((AB[K-1])) | from sys import exit, stdin
N, K = [int(_) for _ in stdin.readline().rstrip().split()]
AB = [list(map(int, stdin.readline().rstrip().split())) for _ in range(N)]
AB.sort(key=lambda ab:ab[0])
total_index = 0
for ab in AB:
total_index += ab[1]
if total_index >= K:
print((ab[0]))
exit() | p03721 |
n,k=list(map(int,input().split()))
a,b=list(map(int,input().split()))
s=[]
s+=[a]*b
for i in range(n-1):
a,b=list(map(int,input().split()))
if a>s[-1] and len(s)>k:
continue
s+=[a]*b
s=sorted(s)[:k]
print((s[k-1])) | n,k=list(map(int,input().split()))
d=[0]*(10**5+1)
for i in range(n):
a,b=list(map(int,input().split()))
d[a]+=b
for i in range(10**5+1):
if d[i]>=k:
print(i)
break
else:k-=d[i]
| p03721 |
N,K =list(map(int,input().split()))
result = []
for i in range(N):
a,b = list(map(int,input().split()))
result +=[a]*b
result.sort()
print((result[K-1])) | N,K =list(map(int,input().split()))
result = [0]*(10**5+1)
for i in range(N):
a,b = list(map(int,input().split()))
result[a] += b
count = 0
for j in range(len(result)):
count += result[j]
if count >= K:
print(j)
break | p03721 |
from collections import Counter
N, K = list(map(int, input().split()))
C = Counter()
for _ in range(N):
a, b = list(map(int, input().split()))
C += {a: b}
# print(C)
L = list(C.keys())
L.sort()
i = 0
ct = C[L[0]]
while ct < K:
i += 1
ct += C[L[i]]
print((L[i]))
| N, K = list(map(int, input().split()))
C = [0]*(10**5+1)
S=set()
for _ in range(N):
a, b = list(map(int, input().split()))
C[a] += b
S.add(a)
L = list(S)
L.sort()
i = 0
ct = C[L[0]]
while ct < K:
i += 1
ct += C[L[i]]
print((L[i]))
| p03721 |
n, k = list(map(int, input().split()))
ab = [list(map(int, input().split()))for _ in range(n)]
ab.sort()
cnt = 0
for a, b in ab:
cnt += b
if cnt >= k:
print(a)
exit()
| n, k = list(map(int, input().split()))
ab = sorted([list(map(int, input().split())) for _ in range(n)])
cnt = 0
for a, b in ab:
cnt += b
if cnt >= k:
print(a)
exit()
| p03721 |
def slove():
import sys
input = sys.stdin.readline
n, k = list(map(int, input().rstrip('\n').split()))
ab = sorted([list(map(int, input().rstrip('\n').split())) for _ in range(n)])
t = 0
for a, b in ab:
t += b
if t >= k:
print(a)
exit()
if __name__ == '__main__':
slove()
| def slove():
import sys
input = sys.stdin.readline
n, k = list(map(int, input().rstrip('\n').split()))
ab = [list(map(int, input().rstrip('\n').split())) for _ in range(n)]
ab.sort()
cnt = 0
for a, b in ab:
cnt += b
if cnt >= k:
print(a)
exit()
if __name__ == '__main__':
slove()
| p03721 |
N, K = list(map(int, input().split()))
a = []
for i in range(N):
x, y = list(map(int, input().split()))
for j in range(y):
a.append(x)
a.sort()
print((a[K - 1])) | N, K = list(map(int, input().split()))
a = []
b = []
Sum = 0
for i in range(N):
x, y = list(map(int, input().split()))
a.append(x)
b.append(y)
s = [*list(range(len(a)))]
sort_s = sorted(s, key = lambda i: a[i])
sort_a = [a[i] for i in sort_s]
sort_b = [b[i] for i in sort_s]
for i in range(N):
Sum += sort_b[i]
if Sum >= K:
print((sort_a[i]))
break | p03721 |
import heapq
def solve():
firstline = input().split(' ')
N = int(firstline[0])
K = int(firstline[1])
heap = []
for i in range(N) :
ar = input().split(' ')
a = int(ar[0])
b = int(ar[1])
heapq.heappush(heap, (a, b))
count = 0
while len(heap) > 0 :
t = heapq.heappop(heap)
count += t[1]
if (count >= K) : return t[0]
return -1
if __name__ == '__main__' :
print(solve()) | N,K = list(map(int,input().split()))
src = [tuple(map(int,input().split())) for i in range(N)]
s = 0
for a,b in sorted(src):
s += b
if s >= K:
print(a)
break
| p03721 |
from collections import Counter
N,K = list(map(int,input().split()))
src = [tuple(map(int,input().split())) for i in range(N)]
ctr = Counter()
for a,b in src:
ctr[a] += b
tmp = 0
for k,v in sorted(ctr.items()):
tmp += v
if tmp >= K:
print(k)
exit() | from collections import Counter
N,K = list(map(int,input().split()))
src = [tuple(map(int,input().split())) for i in range(N)]
ctr = Counter()
for a,b in src:
ctr[a] += b
now = 0
for k,v in sorted(ctr.items()):
if now + v < K:
now += v
else:
print(k)
break | p03721 |
def main():
N, K = list(map(int, input().split()))
ans = []
for i in range(N):
a, b = list(map(int, input().split()))
for i in range(b):
ans.append(a)
sort_ans = sorted(ans)
print((sort_ans[K-1]))
main()
| def main():
N, K = list(map(int, input().split()))
ans = [0] * (10 ** 5 + 1)
for i in range(N):
a, b = list(map(int, input().split()))
ans[a] += b
for i in range(10 ** 5 + 1):
if K <= ans[i]:
print(i)
exit()
else:
K -= ans[i]
main()
| p03721 |
n, k = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n)]
ans = [a[i][0] for i in range(n) for _ in range(a[i][1])]
print((sorted(ans)[k-1])) | n, k = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n)]
ans = 0
i = 0
a = sorted(a)
while True:
ans += a[i][1]
if ans >= k:
break
i += 1
print((a[i][0]))
| p03721 |
N, K = list(map(int, input().split()))
array = []
for _ in range(N):
a, b = list(map(int, input().split()))
array.extend([a] * b)
array.sort()
print((array[K - 1]))
| from collections import Counter
N, K = list(map(int, input().split()))
c = Counter()
for _ in range(N):
a, b = list(map(int, input().split()))
c[a] += b
for item in sorted(list(c.items()), key=lambda x: x[0]):
if item[1] >= K:
print((item[0]))
break
else:
K -= item[1]
| p03721 |
N, K = list(map(int, input().split()))
l = []
for i in range(N):
a, b = list(map(int, input().split()))
for j in range(b):
l.append(a)
print((sorted(l)[K-1])) | N, K = list(map(int, input().split()))
l = [0 for i in range(100001)]
num_count = 0
n = 0
for j in range(N):
a, b = list(map(int, input().split()))
l[a] += b
for k in l:
num_count += k
if num_count >= K:
print(n)
break
else:
n += 1 | p03721 |
n, k = list(map(int,input().split()))
arr = []
for i in range(n):
a,b = list(map(int,input().split()))
arr += [a] * b
arr.sort()
print((arr[k - 1])) | n, k = list(map(int,input().split()))
arr = []
for _ in range(n):
a,b = list(map(int,input().split()))
arr.append([a,b])
arr.sort()
for i in arr:
k -= i[1]
if k <= 0:
print((i[0]))
break | p03721 |
from collections import deque
n,k=list(map(int,input().split()))
ints=[list(map(int,input().split())) for _ in range(n)]
d=deque()
for x in ints:
d.extend([x[0]]*x[1])
ans=sorted(list(d))
print((ans[k-1])) | import sys
rl=sys.stdin.readline
def main():
n,k=list(map(int,rl().strip().split()))
ints=[list(map(int,rl().strip().split())) for _ in range(n)]
ints.sort(key=lambda e:e[0])
s=0
for e in ints:
s+=e[1]
if s>=k:
print((e[0]))
break
if __name__=='__main__':
main()
| p03721 |
N,K=list(map(int,input().split()))
A=[]
C=[]
for i in range(N):
a,b=list(map(int,input().split()))
T=[a,b]
A.append(T)
A.sort()
for i in range(N):
if len(C)>K:
break
for j in range(A[i][1]):
C.append(A[i][0])
if len(C)>K:
break
print((C[K-1])) | N,K=list(map(int,input().split()))
A=[]
C=[]
for i in range(N):
a,b=list(map(int,input().split()))
T=[a,b]
A.append(T)
A.sort()
counter=0
for i in range(N):
counter+=A[i][1]
if counter>=K:
counter=i
break
print((A[counter][0])) | p03721 |
N,K = list(map(int,input().split()))
ans = []
for i in range(N):
a,b = list(map(int,input().split()))
for j in range(b):
ans.append(a)
ans.sort()
print((ans[K-1])) | N,K = list(map(int,input().split()))
ans = []
for i in range(N):
ab = list(map(int,input().split()))
ans.append(ab)
ans.sort()
l = 0
for i in range(N):
l += ans[i][1]
if l >= K:
s = i
break
print((ans[s][0])) | p03721 |
from sys import stdin
from operator import itemgetter
def main():
lines = stdin.readlines()
N, K = list(map(int, lines[0].split()))
abn = [[int(abi) for abi in line.split()] for line in lines[1:]]
abn.sort(key=itemgetter(0))
cnt = 0
for ai, bi in abn:
cnt += bi
if K <= cnt:
print(ai)
break
return
main()
| from sys import stdin
def main():
lines = stdin.readlines()
N, K = list(map(int, lines[0].split()))
bn = [0] * (int(1e5) + 1)
for line in lines[1:]:
ai, bi = list(map(int, line.split()))
bn[ai] += bi
cnt = 0
for ai, bi in enumerate(bn):
cnt += bi
if K <= cnt:
print(ai)
break
return
main()
| p03721 |
N,K = list(map(int,input().split()))
numarray = list()
for i in range(N):
a,b = list(map(int,input().split()))
numarray.extend([a]*b)
# print(numarray)
numarray.sort()
print((numarray[K-1])) | from itertools import chain
N,K = list(map(int,input().split()))
num_bool = [0]*(10**5)
numarray_ind = list()
for i in range(N):
a,b = list(map(int,input().split()))
num_bool[a-1] += b
# print(num_bool)
sum_count = 0
k=1
for i in range(10**5):
sum_count += num_bool[i]
if(sum_count >= K):
break
k+=1
print(k) | p03721 |
N, K = list(map(int, input().split()))
nums = []
for _ in range(N):
a, b = list(map(int, input().split()))
nums += [a] * b
nums.sort()
print((nums[K - 1])) | N, K = list(map(int, input().split()))
nums = []
for _ in range(N):
a, b = list(map(int, input().split()))
nums.append([a, b])
cnt = 0
nums.sort()
for num in nums:
cnt += num[1]
if cnt >= K:
print((num[0]))
break
| p03721 |
N,K = list(map(int,input().split()))
big_array = []
for i in range(N):
a,b = list(map(int,input().split()))
for j in range(b):
big_array.append(a)
big_array.sort()
print((big_array[K-1])) | N,K = list(map(int,input().split()))
ab = []
for i in range(N):
a,b = list(map(int,input().split()))
ab.append([a,b])
ab.sort()
while K > 0:
for _ab in ab:
K -= _ab[1]
if K <= 0:
print((_ab[0]))
break | p03721 |
N,K=list(map(int,input().split()))
ab=[[0]*2 for i in range(N)]
for i in range(N):
ab[i]=list(map(int,input().split()))
ab=sorted(ab,key=lambda x:x[0])
i=-1
while(K > 0):
i+=1
K -= ab[i][1]
print((ab[i][0])) | N, K = list(map(int, input().split()))
ab = [tuple(map(int, input().split())) for i in range(N)]
ab.sort()
id = 0
for a, b in ab:
if id + b >= K:
print(a)
break
else:
id += b
| p03721 |
line_one = input().split()
n = int(line_one[0])
k = int(line_one[1])
arr = []
for i in range(n):
line = input().split()
a = int(line[0])
b = int(line[1])
arr += [a] * b
arr = sorted(arr)
print(arr[k-1])
| line_one = input().split()
n = int(line_one[0])
k = int(line_one[1])
tuples = []
arr = []
for i in range(n):
line = input().split()
tuples.append( (int(line[0]), int(line[1])) )
tuples = sorted(tuples, key = lambda x: x[0])
total = 0
for tup in tuples:
total += tup[1]
if total >= k:
print(tup[0])
break
| p03721 |
N,K = list(map(int,input().split()))
now = 0
lis = []
for i in range(N):
a,b = list(map(int,input().split()))
lis += [a]*b
lis.sort()
print((lis[K-1]))
|
N,K = list(map(int,input().split()))
now = 0
dic = {}
lis = []
for i in range(N):
a,b = list(map(int,input().split()))
if a in dic:
dic[a] += b
else:
dic[a] = b
lis.append(a)
lis.sort()
for i in lis:
now += dic[i]
if now >= K:
print (i)
break
| p03721 |
n, k = list(map(int, input().split()))
l = [list(map(int, input().split())) for _ in range(n)]
c = []
for i in range(n):
for _ in range(l[i][1]):
#print(l[i][0])
c.append(l[i][0])
c.sort()
print((c[k-1])) | N,K=list(map(int,input().split()))
li=sorted([list(map(int,input().split())) for _ in range(N)])
for l in li:
K-=l[1]
if K<=0:
print((l[0]))
break | p03721 |
n, k = list(map(int, input().split()))
count = 0
ab = [list(map(int, input().split())) for _ in range(n)]
ab = sorted(ab)
i = 0
while count < k:
a, b = ab[i]
count += b
i += 1
if count >= k:
print(a)
break
| N, K = list(map(int, input().split()))
now = 0
ab = [list(map(int, input().split())) for _ in range(N)]
ab = sorted(ab)
for a, b in ab:
if now < K <= now+b:
print(a)
exit()
now += b | p03721 |
# Big Array
n,k = list(map(int, input().split()))
A1 = []
for i in range(n):
a,b = list(map(int, input().split()))
A1.append([a]*b)
A2 = []
for s in A1:
A2.extend(s)
print(( sorted(A2)[k-1] )) | # Big Array
n,k = list(map(int, input().split()))
A = []
for i in range(n):
a,b = list(map(int, input().split()))
A.append([a,b])
A.sort(key=lambda x:x[0])
cnt = 0
for i in range(n):
cnt += A[i][1]
if ( cnt >= k ):
print((A[i][0]))
break | p03721 |
import sys
from collections import deque
if sys.platform in ['ios','win32','darwin']:
sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(eval(input()))
def MAP(): return [int(s) for s in input().split()]
N, K = MAP()
A = [MAP() for _ in range(N)]
A.sort()
B = deque()
for a in A:
ai, bi = a
B.extend([ai]*bi)
# print(B)
print((B[K-1])) | import sys
from collections import deque
if sys.platform in ['ios','win32','darwin']:
sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(eval(input()))
def MAP(): return [int(s) for s in input().split()]
N, K = MAP()
A = [MAP() for _ in range(N)]
A.sort()
cur = 0
for a in A:
cur += a[1]
if cur >= K:
print((a[0]))
break | p03721 |
n,k = list(map(int,input().split()))
a =[]
for i in range(n):
a.append(list(map(int,input().split())))
a.sort()
b =[]
for i in range(n):
for j in range(a[i][1]):
b.append(a[i][0])
print((b[k-1])) | n,k = list(map(int,input().split()))
a =[]
for i in range(n):
a.append(list(map(int,input().split())))
a.sort()
b =[]
c =[]
for i in range(n):
b.append(a[i][0])
c.append(a[i][1])
for i in range(n-1):
c[i+1] = c[i]+c[i+1]
ans = c[-1]
for i in range(1,n):
if c[i] >= k:
ans = b[i]
break
print(ans) | p03721 |
# N,Kの把握
l1 = list(map(int, input().split()))
N = l1[0]
K = l1[1]
#空リストを作成。a,bを把握し、リストにaを追加、b回。これをN回くりかえし
l3 = []
for i in range(N):
l2 = list(map(int, input().split()))
a = l2[0]
b = l2[1]
if len(l3) >= K :
if max(l3) <= a:
pass #リストの要素数がKを上回っている場合、要素の最大値よりも大きい数は追加しない。
else:
adl=[a] * b
l3 = l3 + adl
for j in range(len(l3)-K):
l3.remove(max(l3))
else:
adl=[a] * b
l3 = l3 + adl
# リストをソートし、K番目を出力
l3.sort()
print((str(l3[K-1]))) | # N,Kの把握
l1 = list(map(int, input().split()))
N = l1[0]
K = l1[1]
#リストをすぐに作成するのが悪手。数値と回数をセット作成
dic = {}
for i in range(N):
l2 = list(map(int, input().split()))
a = l2[0]
b = l2[1]
if a in dic:
dic[a] += b #既に存在する数値であればそのまま回数を＋
else:
dic.update({a: b}) #新規の数値であれば追加
dic = sorted(list(dic.items()), key=lambda x:x[0])
x = 0
for key, value in dic: #回数値を足していき、総回数＞＝Kとなったときの数値を出力する。
x += value
if x >= K:
print((str(key)))
break | p03721 |
inp = input().split(" ")
N = int(inp[0])
K = int(inp[1])
arr = []
indicies = [0]
for i in range(N):
inp = input().split(" ")
a = int(inp[0])
b = int(inp[1])
if len(arr) == 0 or a >= arr[-1]:
arr += [a] * b
indicies.append(len(arr))
elif a <= arr[0]:
arr = ([a] * b) + arr
for i in range(len(indicies)):
indicies[i] += b
indicies.append(0)
else:
index = 0
for i in range(len(indicies)):
i = indicies[i]
if a >= arr[i-1] and a <= arr[i]:
index = i
arr = arr[0:i] + ([a] * b) + arr[i:]
break
for i in range(len(indicies)):
if indicies[i] > index:
indicies[i] += b
indicies.append(index+b)
print((arr[K-1]))
| x = input().split(" ")
num_operations = int(x[0])
kth_integer = int(x[1])
field = {}
for p in range(0, num_operations):
line = input().split(" ")
a = int(line[0])
b = int(line[1])
if a in field:
field[a] += b
else:
field[a] = b
ks = list(field.keys())
ks.sort()
out = list(field.keys())[-1]
for k in ks:
kth_integer -= field[k]
if (kth_integer <= 0):
out = k
break
print (out)
| p03721 |
n,k = list(map(int, input().split()))
res = []
for _ in range(n):
a,b = list(map(int, input().split()))
res += [a]*b
res.sort()
print((res[k-1])) | n,k = list(map(int, input().split()))
res = [0]*(10**5+1)
for _ in range(n):
a,b = list(map(int, input().split()))
res[a] += b
for i, x in enumerate(res):
if k>x:
k -= x
else:
print(i)
exit() | p03721 |
# ABC061_C
N, K = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
lst = []
for i in range(N):
lst += [AB[i][0]]*AB[i][1]
lst = sorted(lst)
print((lst[K-1]))
| # ABC061_C
N, K = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(N)]
AB = sorted(AB)
for i in range(N):
K -= AB[i][1]
if K <= 0:
print((AB[i][0]))
break | p03721 |
import sys
iN,iK = [int(_) for _ in input().split()]
#aData = [[int(_) for _ in sLine.split()] for sLine in sys.stdin.readlines()]
d = {}
for _ in range(iN):
a,b = [int(_) for _ in sys.stdin.readline().split()]
if a in d:
d[a] += b
else:
d[a] = b
iC = 0
for a in sorted(d.keys()):
iC += d[a]
if iK <= iC :
print(a)
exit()
| import sys
def 解():
iN,iK = [int(_) for _ in input().split()]
#aData = [[int(_) for _ in sLine.split()] for sLine in sys.stdin.readlines()]
d = {}
for a,b in [[int(_) for _ in sLine.split()] for sLine in sys.stdin.readlines()]:
if a in d:
d[a] += b
else:
d[a] = b
iC = 0
for a in sorted(d.keys()):
iC += d[a]
if iK <= iC :
print(a)
exit()
解()
| p03721 |
N, K = list(map(int,input().split()))
A = sorted([list(map(int,input().split())) for _ in range(N)])
cnt = 0
for a in A:
if(cnt < K-a[1]):
cnt += a[1]
else:
print((a[0]))
break
"""
unk buriburi
""" | N, K = list(map(int,input().split()))
AB = sorted([list(map(int,input().split())) for _ in range(N)])
cnt = 0
for a, b in AB:
if(cnt < K - b):
cnt += b
else:
print(a)
break | p03721 |
N, K = [int(x) for x in input().split()]
result = []
for _ in range(N):
a, b = [int(x) for x in input().split()]
result.extend([a] * b)
result.sort()
print((result[K-1]))
| N, K = [int(x) for x in input().split()]
result = {}
for _ in range(N):
a, b = [int(x) for x in input().split()]
if a in result:
result[a] += b
else:
result[a] = b
result = sorted(result.items())
now = 0
for key, value in result:
now += value
if now >= K:
print(key)
exit()
| p03721 |
# -*- coding: utf-8 -*-
n, k = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
ab.sort()
for a, b in ab:
k = k - b
if k <= 0:
break
print(a)
| # -*- coding: utf-8 -*-
n, k = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
ab.sort()
for a, b in ab:
k -= b
if k <= 0:
break
print(a)
| p03721 |
N, K = list(map(int, input().split()))
ans = []
for i in range(N):
a, b = list(map(int, input().split()))
for _ in range(b):
ans.append(a)
print((sorted(ans)[K-1])) | N, K = list(map(int, input().split()))
A = [0] * 10**5
for i in range(N):
a, b = list(map(int, input().split()))
A[a-1] += b
c = 0
for i in range(10**5):
c += A[i]
if c >= K:
break
print((i+1))
| p03721 |
n,k = list(map(int,input().split()))
l = []
for i in range(n):
a,b = list(map(int,input().split()))
l1 = [a]*b
l = l + l1
l.sort()
print((l[k-1])) | n,k = list(map(int,input().split()))
l = []
for i in range(n):
a = list(map(int,input().split()))
l.append(a)
l.sort(key=lambda x:x[0])
count = 0
i = 0
while count < k:
count = count + l[i][1]
i = i + 1
print((l[i-1][0])) | p03721 |
# 2019/07/23
input=open(0).readline
n,k=list(map(int,input().split()))
res=[]
for i in range(n):
a,b=list(map(int,input().split()))
res+=[a]*b
res.sort()
print((res[k-1])) | from heapq import heappop,heappush
input=open(0).readline
n,k=list(map(int,input().split()))
res={}
for i in range(n):
a,b=list(map(int,input().split()))
res[a]=res.get(a,0)+b
que=[]
for key,val in list(res.items()):
heappush(que,(key,val))
while k:
key,val=heappop(que)
if val>=k:
print(key)
exit()
k-=val
| p03721 |
n, k = list(map(int, input().split()))
a_list = []
for i in range(n):
a, b = list(map(int, input().split()))
a_list.extend([a] * b)
if a_list.count(1) >= k:
break
a_list.sort()
print((a_list[k-1])) | n, k = list(map(int, input().split()))
a_list = []
for i in range(n):
a, b = list(map(int, input().split()))
a_list.append([a, b])
a_list.sort(key=lambda x: x[0])
for i in range(n):
k -= a_list[i][1]
if k <= 0:
print((a_list[i][0]))
break
| p03721 |
n,k=list(map(int,input().split()))
array=[]
for i in range(n):
a,b=list(map(int,input().split()))
for j in range(b):
array.append(a)
ans=sorted(array)
print((ans[k-1])) | n,k=list(map(int,input().split()))
array=[]
for i in range(n):
array.append(list(map(int,input().split())))
array.sort(key=lambda x:x[0])
q=True
count=0
i=0
while q:
count +=array[i][1]
if k<=count:
print((array[i][0]))
exit()
else:
i +=1 | p03721 |
n,k=list(map(int,input().split()))
p=[]
for i in range(n):
a,b=list(map(int,input().split()))
p+=[a]*b
p.sort()
print((p[k-1])) | N,K = list(map(int,input().split()))
a = []
M = 0
for i in range(N):
a.append(list(map(int,input().split())))
a.sort()
for i in range(N):
K = K-a[i][1]
if K <= 0:
print((a[i][0]))
break | p03721 |
# =map(int,input().split())
n,m=list(map(int,input().split()))
a =[list(map(int,input().split())) for i in range(n)]
ans=[]
# print(a)
for i in range(n):
for k in range(a[i][1]):
ans.append(a[i][0])
# print(ans)
# ans=[int(i) for i in ans]
# print(ans)
ans.sort()
print((ans[m-1])) | # =map(int,input().split())
n,m=list(map(int,input().split()))
a =[list(map(int,input().split())) for i in range(n)]
a.sort()
import sys
# ans=dict(a)
# print(a)
cnt=0
for i in range(n):
z=cnt+a[i][1]
if z>=m:
print((a[i][0]))
sys.exit()
else:
cnt=z
# print(a)
# for i in range(n):
# for k in range(a[i][1]):
# ans.append(a[i][0])
# print(ans)
# ans=[int(i) for i in ans]
# print(ans)
# print(ans[m-1])
| p03721 |
import sys
from operator import itemgetter
input = sys.stdin.readline # NOQA
def main():
N, K = list(map(int, input().split()))
ab = [None] * N
for i in range(N):
ab[i] = tuple(map(int, input().split()))
ab.sort(key=itemgetter(0))
cnt = 0
for a, b in ab:
cnt += b
if cnt >= K:
ans = a
break
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline # NOQA
def main():
N, K = list(map(int, input().split()))
cnt = [0] * (1 + 10**5)
for i in range(N):
a, b = list(map(int, input().split()))
cnt[a] += b
total = 0
for i in range(1, 10**5 + 1):
total += cnt[i]
if total >= K:
ans = i
break
print(ans)
if __name__ == "__main__":
main()
| p03721 |
N,K=list(map(int,input().split()))
dic={}
for i in range(N):
a,b=list(map(int,input().split()))
if a in dic:
dic[a]+=b
else:
dic[a]=b
dic=sorted(list(dic.items()),key=lambda x:x[0])
for d in range(len(dic)):
amount=dic[d][1]
if amount>=K:
print((dic[d][0]))
exit(0)
else:
K-=amount
| import sys
readline = sys.stdin.readline
N,K = list(map(int,readline().split()))
AB = [list(map(int,readline().split())) for i in range(N)]
AB = sorted(AB, key = lambda x:x[0])
amount = 0
for a,b in AB:
amount += b
if amount >= K:
print(a)
break
| p03721 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.