input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n, k = list(map(int, input().split()))
c = []
for _ in range(n):
a, b = list(map(int, input().split()))
c.extend([a]*b)
c.sort()
print((c[k-1])) | n, k = list(map(int, input().split()))
aa = []
for _ in range(n):
a, b = list(map(int, input().split()))
aa.append([a, b])
aa.sort()
c = 0
for a, b in aa:
if c < k:
c += b
if c >= k:
ans = a
break
print(ans) | p03721 |
from collections import defaultdict
n,k=list(map(int,input().split()))
d=defaultdict(int)
for i in range(n):
a,b=list(map(int,input().split()))
d[a]+=b
l=sorted(d.keys())
cnt=0
for i in l:
cnt+=d[i]
if cnt>=k:
print(i)
exit() | n,k=list(map(int,input().split()))
d={}
for i in range(n):
a,b=list(map(int,input().split()))
if a in d:
d[a]+=b
else:
d[a]=b
d_keys=sorted(d.keys())
cnt=0
for i in d_keys:
cnt+=d[i]
if cnt>=k:
print(i)
exit() | p03721 |
n,k=list(map(int,input().split()))
l=[0 for i in range(10**5)]
for i in range(n):
a,b=list(map(int,input().split()))
a-=1
l[a]+=b
cnt=0
for i in range(len(l)):
cnt+=l[i]
if cnt>=k:
print((i+1))
exit() | from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
from bisect import bisect_left
n,k=nii()
l=[]
for i in range(n):
a,b=nii()
l.append([a,b])
l.sort(key=lambda x:x[0])
a_l=[]
b_l=[]
for a,b in l:
a_l.append(a)
b_l.append(b)
b_rui=[0]
for i in range(1,n+1):
b_rui.append(b_rui[i-1]+b_l[i-1])
b_rui=b_rui[1:]
inx=bisect_left(b_rui,k)
print((a_l[inx])) | p03721 |
n, k = list(map(int,input().split()))
ans = []
for i in range(n):
x, y = list(map(int,input().split()))
ans += [x]*y
ans.sort()
print((ans[k-1])) | n, k = list(map(int,input().split()))
ans = []
x = 0
for i in range(n):
ans.append(list(map(int,input().split())))
ans.sort()
for l in ans:
x += l[1]
if x < k:
continue
else:
print((l[0]))
exit() | p03721 |
N, K = list(map(int,input().split( )))
l = []
for i in range(N):
a, b = list(map(int, input().split( )))
for i in range(b):
l.append(a)
l.sort()
print((l[K-1])) | from collections import defaultdict
N, K = list(map(int,input().split( )))
a = []
b = []
for i in range(N):
a_i, b_i = list(map(int, input().split( )))
a.append(a_i)
b.append(b_i)
d = defaultdict(int)
for i in range(N):
if a[i] in d:
d[a[i]] += b[i]
else:
d[a[i]] = b[i]
d_sorted = sorted(d.items())
l = 0
for i in range(N):
a_i = d_sorted[i][0]
b_i = d_sorted[i][1]
l += b_i
if l >= K:
print(a_i)
break | p03721 |
def main():
N, K = list(map(int, input().split()))
ary = []
i = 0
while i < N:
a, b = list(map(int, input().split()))
ary += [a] * b
i += 1
ans = sorted(ary)[K-1]
print(ans)
main()
| def main():
N, K = list(map(int, input().split()))
ab = []
i = 0
while i < N:
a, b = list(map(int, input().split()))
ab.append([a, b])
i += 1
ary = sorted(ab)
j = 0
for i in ary:
j += i[1]
if j >= K:
print((i[0]))
break
main()
| p03721 |
int_n, int_k = list(map(int, input().split()))
ar_int = list()
for i in range(int_n):
int_a, int_b = list(map(int, input().split()))
for x in range(int_b):
ar_int.append(int_a)
print((sorted(ar_int)[int_k - 1]))
| int_n, int_k = list(map(int, input().split()))
li_wk = list()
for i in range(int_n):
li_wk.append(list(map(int, input().split())))
li_wk.sort(key=lambda x: x[0])
counter = 1
for l in li_wk:
if counter <= int_k <= (counter + l[1] - 1):
print((l[0]))
counter += l[1]
| p03721 |
L=lambda:list(map(int,input().split()))
n,k=L()
ab=sorted([L()for _ in range(n)])
for a,b in ab:
k-=b
if k<=0:
print(a)
exit() | n,k=list(map(int,input().split()))
ab=[]
for _ in range(n):
a,b=list(map(int,input().split()))
ab.append((a,b))
ab.sort()
for i,j in ab:
k-=j
if k<=0:
print(i)
exit() | p03721 |
N, M = list(map(int, input().split(' ')))
A = []
for i in range(N):
a, b = list(map(int, input().split(' ')))
A.append([a]*b)
A.sort()
A = [i for v in A for i in v]
print((A[M-1]))
| N, M = list(map(int, input().split(' ')))
A = []
for i in range(N):
a, b = list(map(int, input().split(' ')))
A.append([a, b])
A.sort()
i = -1
count=0
while(True):
i += 1
count += A[i][1]
if count >= M:
print((A[i][0]))
break | p03721 |
f=lambda:list(map(int,input().split()));n,k=f();c=0
for a,b in sorted(list(f())for _ in range(n)):
c+=b
if c>=k:print(a);break | f=lambda:list(map(int,input().split()));n,k=f();c=0
for a,b in sorted(list(f())for _ in[0]*n):
c+=b
if c>=k:print(a);break | p03721 |
N,K=list(map(int,input().split()))
S=[]
for i in range(N):
a,b=list(map(int,input().split()))
for i in range(b):
S.append(a)
S=sorted(S)
print((S[K-1])) | N,K=list(map(int,input().split()))
S={}
for i in range(N):
a,b=list(map(int,input().split()))
if a in S:
S[a]+=b
else:
S[a]=b
T=sorted(S.items())
count=0
for i in range(len(T)):
count+=T[i][1]
if count>=K:
print((T[i][0]))
break
| 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)
#print(ans)
ans.sort()
print((ans[k - 1])) | n, k = list(map(int,input().split()))
ans = [0]*100000
for i in range(n):
a, b = list(map(int,input().split()))
ans[a-1] += b
#print(ans)
counter = 0
while(k > 0):
k -= ans[counter]
counter += 1
print(counter)
#1 | p03721 |
n,k=list(map(int,input().split()))
num=[list(map(int,input().split()))for _ in range(n)]
p=0
num.sort()
for i in range(n):
p+=num[i][1]
if k<=p:
ans=num[i][0]
print(ans)
exit()
| n,k=list(map(int,input().split()))
a=[list(map(int,input().split()))for i in range(n)]
a.sort(key=lambda x:x[0])
count=0
for i,j in a:
count+=j
if k<=count:
print(i)
exit() | p03721 |
n,k=list(map(int,input().split()))
a=[list(map(int,input().split()))for i in range(n)]
a.sort(key=lambda x:x[0])
count=0
for i,j in a:
count+=j
if k<=count:
print(i)
exit() | n,k=list(map(int,input().split()))
t=[tuple(map(int,input().split()))for i in range(n)]
t=sorted(t,key=lambda t:t[0])
total=0
for i in range(n):
total+=t[i][1]
if k<=total:
print((t[i][0]))
exit()
| p03721 |
N, K = list(map(int, input().split()))
ab = [[0, 0]] * N
for i in range(N):
_a, _b = list(map(int, input().split()))
ab[i] = [_a, _b]
ab.sort(key=lambda x:x[0])
j = 0
index = 0
while j < K:
j += ab[index][1]
if j < K:
index += 1
print((ab[index][0]))
| N, K = list(map(int, input().split()))
ab = [[0, 0]] * N
for i in range(N):
_a, _b = list(map(int, input().split()))
ab[i] = [_a, _b]
ab.sort(key=lambda x:x[0])
total = 0
for pair in ab:
total += pair[1]
if total >= K:
print((pair[0]))
break
| p03721 |
n, k = list(map(int, input().split()))
s = []
for i in range(n):
a, b = list(map(int, input().split()))
for j in range(b):
s.append(a)
s = sorted(s)
print((s[k-1])) | n, k = list(map(int, input().split()))
A = []
for i in range(n):
c = []
a, b = list(map(int, input().split()))
c.append(a)
c.append(b)
A.append(c)
A.sort(key=lambda x:x[0])
f = k
i = 0
while f > 0:
f -= A[i][1]
i += 1
print((A[i-1][0])) | p03721 |
from collections import Counter
N,K = list(map(int,input().split()))
tmp = Counter()
for i in range(N):
a,b = list(map(int,input().split()))
tmp.update([a]*b)
print((sorted(tmp.elements())[K-1])) | n,k=[int(x) for x in input().split()]
s=[]
for i in [None]*n:
a,b=[int(x) for x in input().split()]
s.append((a,b))
s=sorted(s,key=lambda x : x[0])
for i in s:
if i[1]>=k:
print((i[0]))
break
else:
k-=i[1] | p03721 |
if __name__ == '__main__':
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])) | if __name__ == '__main__':
N,K=list(map(int,input().split()))
AB=[tuple(map(int,input().split())) for i in range(N)]
AB.sort(key=lambda x:x[0])
for a,b in AB:
K-=b
if K<=0:
print(a)
break
| p03721 |
n , k = list(map(int, input().split()))
x=[]
for i in range(n):
a , b = list(map(int, input().split()))
x+=[a]*b
x.sort()
print((x[k-1]))
| n , k = list(map(int, input().split()))
x=[]
j=0
c=0
for i in range(n):
a , b = list(map(int, input().split()))
x.append([a,b])
x.sort(key = lambda x :x[0])
while True:
c+=x[j][1]
if c>=k:
print((x[j][0]))
break
j+=1
| p03721 |
N,K=list(map(int,input().split()))
ans=[]
for i in range(N):
a,b=list(map(int,input().split()))
tmp_ = [a]*b
ans.extend(tmp_)
ans = sorted(ans)
print((ans[K-1])) | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
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
remain = K
for i in range(10**5+1):
if ans[i] == 0:
continue
remain -= ans[i]
if remain <= 0:
print(i)
exit() | p03721 |
def main():
n,k=list(map(int,input().split()))
arr = []
for _ in range(n):
a,b=list(map(int,input().split()))
arr.extend([a]*b)
arr.sort()
print((arr[k-1]))
if __name__ == "__main__":
main() | def main():
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 x, c in arr:
if k <= c:
print(x)
break
else:
k -= c
if __name__ == "__main__":
main() | p03721 |
import heapq
n,k = list(map(int,input().split()))
c = []
heapq.heapify(c)
for i in range(n):
a,b = list(map(int,input().split()))
c+=([a]*b)
heapq.heapify(c)
l = heapq.nsmallest(k,c)
print((l[-1]))
| import heapq
n,k = list(map(int,input().split()))
d = {}
z = []
for i in range(n):
a,b = list(map(int,input().split()))
z.append([a,b])
d[a] = 0
for i in range(len(z)):
d[z[i][0]]+=z[i][1]
c = sorted(d.keys())
l=0
for i in range(len(c)):
if(k<=0):
print((c[i-1]))
l+=1
break
k-=d[c[i]]
if(l!=1):
print((c[-1]))
| p03721 |
N,K=list(map(int,input().split()))
from collections import defaultdict
data=defaultdict(int)
for n in range(N):
a,b=list(map(int,input().split()))
data[a]+=b
now=0
for i in range(len(data)):
idx=min(data.keys())
now+=data[idx]
if now>=K:
print(idx)
break
data.pop(idx) | N,K=list(map(int,input().split()))
from collections import defaultdict
data=[]
for n in range(N):
data.append(tuple(map(int,input().split())))
data.sort(key=lambda x:x[0])
now=0
for i in range(len(data)):
now+=data[i][1]
if now>=K:
print((data[i][0]))
break | p03721 |
# 操作回数（N）および数を求めたい順位（K）を入力する
N, K = list(map(int, input().split()))
# 整数を格納するリスト（list_num）を定義する
list_num = []
# 各操作において、、
for _ in range(N):
# 挿入する整数（a）とその個数（b）を入力する
a, b = list(map(int, input().split()))
# list_numにaをb個だけ挿入する
list_num.extend([a] * b)
# list_numを昇順にソートする
list_num.sort()
# K番目に小さい数を返す
print((list_num[K - 1])) | # 操作回数（N）および数を求めたい順位（K）を入力する
N, K = list(map(int, input().split()))
# 挿入する整数（a）とその個数（b）の組を格納するリスト（list_ab）を定義する
list_ab = []
# 各操作において、、
for _ in range(N):
# aおよびbを入力する
a, b = list(map(int, input().split()))
# list_abにaとb個の組を追加する
list_ab.append((a, b))
# list_abをaが昇順に並ぶようにソートする
list_ab.sort()
# bの合計を計算する変数（sum_b）を定義する
sum_b = 0
# 各a、bの組について、、
for a, b in list_ab:
# sum_bにbを足す
sum_b += b
# sum_bがK以上になった場合、、
if sum_b >= K:
# aを出力する
print(a)
break | p03721 |
n, k = list(map(int, input().split()))
c = []
for i in range(n):
a, b = list(map(int, input().split()))
c.extend([a]*b)
print((sorted(c)[k-1]))
| n, k = list(map(int, input().split()))
ab = []
count = 0
for i in range(n):
ab.append(list(map(int, input().split())))
ab.sort()
for i in range(k):
count += ab[i][1]
if(count >= k):
print((ab[i][0]))
break | p03721 |
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()
cnt = 0
X = []
for i in range(n):
a, b = AB[i]
X += [a]*b
cnt += b
if cnt > k:
break
X.sort()
print((X[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()
cnt = 0
for a, b in AB:
cnt += b
if cnt >= k:
print(a)
break
| p03721 |
n,k = list(map(int, input().split()))
lst = []
for i in range(n):
a,b = list(map(int, input().split()))
lst += [a for i in range(b)]
# print(lst)
lst.sort()
print((lst[k-1])) | n,k = list(map(int, input().split()))
lst = [None for i in range(n)]
for i in range(n):
a,b = list(map(int, input().split()))
lst[i] = (a,b)
# print(lst)
lst.sort(key=lambda x:x[0])
# print(lst)
count = 0
for i in range(n):
count += lst[i][1]
if count>=k:
print((lst[i][0]))
exit()
| p03721 |
N,K=[int(i) for i in input().split(" " )]
s = []
for i in range(N):
s.append([int(ii) for ii in input().split(" ")])
p = []
for i in s:
_ = [p.append(i[0]) for ii in range(i[1])]
p.sort()
print((p[K-1]))
| N,K=[int(i) for i in input().split(" " )]
s = []
for i in range(N):
s.append([int(ii) for ii in input().split(" ")])
s.sort( key=lambda x: x[0])
countPush = 0
for i in s:
countPush += i[1]
if(countPush >= K ):
print((i[0]))
break
| p03721 |
N, K = list(map( int, input().split()))
A = []
for i in range(N):
a, b = list(map( int, input().split()))
A += [a]*b
A.sort()
A = A[:K]
print((A[K-1])) | N, K = list(map( int, input().split()))
A = [ [0]*2 for _ in range(N)]
for i in range(N):
A[i] = list(map( int, input().split()))
A.sort()
L = 0
for i in range(N):
L += A[i][1]
if L >= K:
print((A[i][0]))
break | p03721 |
N,K=list(map(int,input().split()))
ablist=[]
for _ in range(N):
a,b=list(map(int,input().split()))
ablist.append((a,b))
ablist.sort()
aslist=[]
s=0
for a,b in ablist:
s+=b
aslist.append((a,s))
#print(aslist)
for a,s in aslist:
if s>=K:
print(a)
break | N,K=list(map(int,input().split()))
ablist=[]
for _ in range(N):
a,b=list(map(int,input().split()))
ablist.append((a,b))
ablist.sort()
s=0
for a,b in ablist:
s+=b
if s>=K:
print(a)
break | p03721 |
import itertools
import math
import string
import collections
from collections import Counter
from collections import deque
from operator import itemgetter
import sys
sys.setrecursionlimit(2*10**5)
INF = 2**60
def readints():
return list(map(int, input().split()))
def nCr(n, r):
return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))
def has_duplicates2(seq):
seen = []
for item in seq:
if not(item in seen):
seen.append(item)
return len(seq) != len(seen)
def divisor(n):
divisor = []
for i in range(1, n+1):
if n % i == 0:
divisor.append(i)
return divisor
# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
n, k = list(map(int, input().split()))
ans = []
for i in range(n):
a, b = readints()
for j in range(b):
ans.append(a)
aannss = sorted(ans)
print((aannss[k-1]))
| import itertools
import math
import string
import collections
from collections import Counter
from collections import deque
from operator import itemgetter
import sys
sys.setrecursionlimit(2*10**5)
INF = 2**60
def readints():
return list(map(int, input().split()))
def nCr(n, r):
return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))
def has_duplicates2(seq):
seen = []
for item in seq:
if not(item in seen):
seen.append(item)
return len(seq) != len(seen)
def divisor(n):
divisor = []
for i in range(1, n+1):
if n % i == 0:
divisor.append(i)
return divisor
# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
n, k = list(map(int, input().split()))
ab = [readints() for _ in range(n)]
# print(ab)
abab = sorted(ab)
# print(abab)
tmp = 0
for i in range(n):
tmp += abab[i][1]
if tmp >= k:
print((abab[i][0]))
break
| p03721 |
n, k = list(map(int, input().split()))
num = []
cnt = [0] * (10**5 + 1)
for _ in range(n):
a, b = list(map(int, input().split()))
if a not in num:
num.append(a)
cnt[a] += b
num.sort()
ans = 0
for i in num:
if cnt[i] >= k:
ans = i
break
else:
k -= cnt[i]
print(ans) | n, k = list(map(int, input().split()))
cnt = [0] * (10**5 + 1)
for _ in range(n):
a, b = list(map(int, input().split()))
cnt[a] += b
for i in range(10**5 + 1):
if k <= cnt[i]:
ans = i
break
else:
k -= cnt[i]
print(ans)
| p03721 |
from collections import defaultdict
n, k = list(map(int, input().split()))
dic = defaultdict(int)
for i in range(n):
a, b = list(map(int, input().split()))
dic[a] += b
t = sorted(dic.keys())
for i in t:
k -= dic[i]
if k <= 0:
print(i)
break | n, K = list(map(int, input().split()))
rec = [0] * (10 ** 5 + 5)
for i in range(n):
a, b = list(map(int, input().split()))
rec[a] += b
for i in range(10 ** 5 + 1):
if rec[i] > 0:
K -= rec[i]
if K <= 0:
print(i)
exit() | p03721 |
import heapq
N, K = list(map(int,input().split()))
Q = []
for i in range(N):
a, b = list(map(int,input().split()))
for j in range(b):
heapq.heappush(Q,a)
for i in range(K-1):
heapq.heappop(Q)
print((heapq.heappop(Q))) | N, K = list(map(int,input().split()))
Q = [0 for i in range(N)]
for i in range(N):
Q[i] = list(map(int,input().split()))
Q.sort()
cnt = 0
j = 0
while cnt < K:
cnt += Q[j][1]
j += 1
print((Q[j-1][0])) | p03721 |
import heapq as q
n, k = list(map(int, input().split()))
l = []
q.heapify(l)
for i in range(n):
a, b = list(map(int, input().split()))
for j in range(b):
q.heappush(l, a)
for i in range(k):
ans = q.heappop(l)
print(ans) | n, k = list(map(int, input().split()))
l = [0]*(10**5+10)
for i in range(n):
a, b = list(map(int, input().split()))
l[a] += b
sum = 0
for i in range(len(l)):
sum += l[i]
if sum >= k:
print(i)
break
| p03721 |
N, K = list(map(int,input().split()))
t = []
for _ in range(N):
a,b = list(map(int,input().split()))
for j in range(b):
t.append(a)
t.sort()
print((t[K-1])) | N, K = list(map(int,input().split()))
a_max = 100000
t = [0 for _ in range(a_max)]
for _ in range(N):
a, b = list(map(int,input().split()))
t[a-1] += b
cnt = 0
for i in range(a_max):
cnt += t[i]
if cnt >= K:
ans = i+1
break
print(ans) | 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()))
cnt = [0]*100001
S = set()
for i in range(N):
a, b = list(map(int, input().split()))
cnt[a-1] += b
S.add(a)
acc = 0
for s in sorted(S):
acc += cnt[s-1]
if acc >= K:
print(s)
break
| p03721 |
n,k=list(map(int,input().split()))
c=[]
for i in range(n):
a,b=list(map(int,input().split()))
c+=[a]*b
c.sort()
print((c[k-1])) | n,K=list(map(int,input().split()));c={}
for i in range(n):
a,b=list(map(int,input().split()))
if a in c:c[a]+=b
else:c[a]=b
for k,v in sorted(c.items()):
K-=v
if K<=0:print(k);exit() | p03721 |
n,k=[int(x) for x in input().rstrip().split()]
dic={}
for i in range(n):
a,b=[int(x) for x in input().rstrip().split()]
if a not in dic:
dic[a]=b
else:
dic[a]+=b
dic=sorted(dic.items())
now=0
for i,v in dic:
now+=v
if k<=now:
print(i)
break
| n,k=[int(x) for x in input().rstrip().split()]
dic={}
for i in range(n):
a,b=[int(x) for x in input().rstrip().split()]
if a not in dic:
dic[a]=b
else:
dic[a]+=b
dic=sorted(list(dic.items()),key=lambda x:x[0])
now=0
for i,v in dic:
now+=v
if k<=now:
print(i)
break
| p03721 |
n, k = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n)]
Table = []
for i in range(n):
Table.extend([a[i][0]]*a[i][1])
print((sorted(Table)[k-1]))
| from operator import itemgetter
n, k = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n)]
a.sort(key=itemgetter(0))
m = 0
for i in range(n):
m += a[i][1]
if k <= m:
print((a[i][0]))
break
| p03721 |
N, K = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(N)]
ans = []
for i in range(N):
ans += [ab[i][0]] * ab[i][1]
ans.sort()
print((ans[K-1])) | N, K = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(N)]
ab.sort()
n = 0
for i in range(N):
if n + ab[i][1] < K:
n += ab[i][1]
else:
print((ab[i][0]))
break | p03721 |
from collections import deque
n,k = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
ab.sort()
cnt = 0
ans = 0
for a,b in ab:
ans = a
cnt += b
if cnt >= k:break
print(ans) | 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: break
print(a) | p03721 |
n,k = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
ans = []
for a,b in ab:
ans += [a] * b
ans.sort()
print((ans[k-1])) | n,k = list(map(int, input().split()))
ab = sorted([list(map(int, input().split())) for _ in range(n)])
for a,b in ab:
if b <= k:
k -= b
else:
k = 0
if k == 0:
print(a)
exit() | p03721 |
n,k = list(map(int,input().split()))
ab = [list(map(int,input().split())) for i 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 i in range(n)]
ab.sort()
tmp=0
i=0
while tmp<k:
tmp+=ab[i][1]
hoge=ab[i][0]
i+=1
print(hoge)
| 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 += [a] * b
arr.sort()
print((arr[k-1])) | N, K = [int(x) for x in input().split()]
arr = [0] * (10**5+1)
for _ in range(N):
a, b = [int(x) for x in input().split()]
arr[a] += b
th = 0
for i in range(1, 10**5+1):
if arr[i] != 0:
th += arr[i]
if th >= K:
print(i)
exit() | p03721 |
N, K = [int(x) for x in input().split()]
arr = [0] * (10**5+1)
for _ in range(N):
a, b = [int(x) for x in input().split()]
arr[a] += b
th = 0
for i in range(1, 10**5+1):
if arr[i] != 0:
th += arr[i]
if th >= K:
print(i)
exit() | N, K = [int(x) for x in input().split()]
arr = [0] * (10**5+1)
for _ in range(N):
a, b = [int(x) for x in input().split()]
arr[a] += b
remain = K
for i in range(1, 10**5+1):
if arr[i] != 0:
remain -= arr[i]
if remain <= 0:
print(i)
exit() | p03721 |
import sys
sys.stdin
N, K = [int(x) for x in input().split()]
arr = [0] * (10**5+1)
for _ in range(N):
a, b = [int(x) for x in input().split()]
arr[a] += b
remain = K
for i in range(1, 10**5+1):
if arr[i] != 0:
remain -= arr[i]
if remain <= 0:
print(i)
exit() | import sys
sys.stdin.readline
N, K = [int(x) for x in input().split()]
arr = [0] * (10**5+1)
for _ in range(N):
a, b = [int(x) for x in input().split()]
arr[a] += b
remain = K
for i in range(1, 10**5+1):
if arr[i] != 0:
remain -= arr[i]
if remain <= 0:
print(i)
exit() | p03721 |
import sys
sys.stdin.readline
N, K = [int(x) for x in input().split()]
arr = [0] * (10**5+1)
for _ in range(N):
a, b = [int(x) for x in input().split()]
arr[a] += b
remain = K
for i in range(1, 10**5+1):
if arr[i] != 0:
remain -= arr[i]
if remain <= 0:
print(i)
exit() | from sys import stdin
input = stdin.readline
N, K = [int(x) for x in input().split()]
arr = [0] * (10**5+1)
for _ in range(N):
a, b = [int(x) for x in input().split()]
arr[a] += b
remain = K
for i in range(1, 10**5+1):
if arr[i] != 0:
remain -= arr[i]
if remain <= 0:
print(i)
exit() | p03721 |
N, K = list(map(int, input().split()))
c = []
for _ in range(N):
a, b= list(map(int, input().split()))
for i in range(b):
c.append(a)
print((sorted(c)[K-1])) | N, K = list(map(int, input().split()))
num = [0]*(10**5+1)
for i in range(N):
a, b= list(map(int, input().split()))
num[a] += b
for i in range(1, 10**5+1):
if K <= num[i]:
print(i)
exit()
K -= num[i] | 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 += p
P.sort()
print((P[K-1])) | N, K = list(map(int,input().split()))
P = [list(map(int,input().split())) for _ in range(N)]
p = 0
P.sort()
for i in range(N):
p += P[i][1]
if p >= K:
ans = P[i][0]
break
print(ans) | p03721 |
n,k=list(map(int,input().split()))
l=[0]
for _ in range(n):
a,b=list(map(int,input().split()))
l+=[a]*b
l.sort()
print((l[k])) | n,k=list(map(int,input().split()))
l=[0]*(10**5+1)
for _ in range(n):
a,b=list(map(int,input().split()))
l[a]+=b
s=0
for i in range(len(l)):
s+=l[i]
if s>=k:
print(i)
break | p03721 |
n, k = list(map(int, input().split()))
a = [0] * n
b = [0] * n
for i in range(n):
a[i], b[i] = list(map(int ,input().split()))
#愚直な実装だけどいけるかなって感じ
lis = []
for i in range(n):
for j in range(b[i]):
lis.append(a[i])
lis.sort()
print((lis[k-1])) | n, k = list(map(int, input().split()))
a = [0] * n
b = [0] * n
for i in range(n):
a[i], b[i] = list(map(int ,input().split()))
judge = 0
dic = {}
for i in range(n):
if a[i] in dic:
dic[a[i]] += b[i]
else:
dic[a[i]] = b[i]
#print(dic)
dic = list(dic.items())
dic.sort()
#print(dic)
for i in range(10**9):
if judge >= k:
print((dic[i-1][0]))
break
else:
judge += int(dic[i][1])
#print(judge)
| p03721 |
# ABC 061: C – Big Array
N, K = [int(i) for i in input().split()]
a, b = [], []
for _ in range(N):
tmp = input().split()
a.append(int(tmp[0]))
b.append(int(tmp[1]))
sequence = []
for i in range(N):
sequence += [a[i]] * b[i]
sequence.sort()
print((sequence[K - 1])) | # ABC 061: C – Big Array
N, K = [int(i) for i in input().split()]
a, b = [], []
for _ in range(N):
tmp = input().split()
a.append(int(tmp[0]))
b.append(int(tmp[1]))
cnt = [0] * (100000 + 1)
for i in range(N):
cnt[a[i]] += b[i]
for j in range(100000 + 1):
if K <= cnt[j]:
print(j)
break
K -= cnt[j] | 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 = []
count = 0
for i in range(n):
a.append(list(map(int, input().split())))
a = sorted(a, key = lambda x: x[0])
i = 0
while count < k:
count += a[i][1]
ans = a[i][0]
i += 1
print (ans)
| p03721 |
import collections
d={}
N,K=list(map(int,input().split()))
for i in range(N):
a,b=list(map(int,input().split()))
# print a,b
if a in d:
d[a] = d[a] + b
else:
d[a]=b
td={}
cnt=0
# print d
for key in sorted(d):
# print key
if cnt<=K:
td[key]=d[key]
else:
break
d=td
aa=None
cnt=0
#print d
for k in sorted(d):
aa=k
cnt+=d[k]
# print cnt
if cnt>=K:
break
print(aa)
|
d={}
N,K=list(map(int,input().split()))
for i in range(N):
a,b=list(map(int,input().split()))
# print a,b
if a in d:
d[a] = d[a] + b
else:
d[a]=b
# td={}
# cnt=0
# print d
# for key in sorted(d):
# print key
# if cnt<=K:
# td[key]=d[key]
# else:
# break
# d=td
aa=None
cnt=0
#print d
for k in sorted(d):
aa=k
cnt+=d[k]
# print cnt
if cnt>=K:
break
print(aa)
| p03721 |
N,K = list(map(int,input().split()))
Z = []
for i in range(N):
a,b = list(map(int,input().split()))
Z.append((a,b))
Z = sorted(Z)
for a,b in Z:
K -= b
if K <= 0:
print(a)
break | 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()
cnt = 0
for ab in AB:
a,b = ab
cnt += b
if cnt >= K:
print(a)
break
| p03721 |
n, k = list(map(int, input().split()))
l = []
for i in range(n):
a, b = list(map(int, input().split()))
l += [a] * b
l.sort()
print((l[k-1]))
| n, k = list(map(int, input().split()))
l = [0] * (10**5 + 1)
for i in range(n):
a, b = list(map(int, input().split()))
l[a] += b
s = 0
for i, v in enumerate(l):
s += v
if s >= k:
print(i)
break | p03721 |
N, K = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(N)]
ab.sort()
counter = 0
array1 = []
for i in range(N):
for j in range(ab[i][1]):
array1.append(ab[i][0])
if len(array1) >= K:
break
print((array1[K-1])) | N, K = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(N)]
ab.sort()
counter = 0
array1 = []
for i in range(N):
counter += ab[i][1]
if K <= counter:
ans = ab[i][0]
break
print(ans) | p03721 |
import sys
N, K = (int(i) for i in input().split())
ab_list = [[int(i) for i in input().split()] for i in range(N)]
a = [0]*N
b = [0]*N
for i, ab in zip(list(range(N)), ab_list):
_a, _b = ab
a[i] = _a
b[i] = _b
idx = 0
cnt = 0
while N > cnt:
min = 1e6
for i in range(cnt, N):
if min > a[i]:
min = a[i]
idx = i
a_tmp = a[cnt]
b_tmp = b[cnt]
a[cnt] = a[idx]
b[cnt] = b[idx]
a[idx] = a_tmp
b[idx] = b_tmp
cnt += 1
#print a, b
num = 0
for i in range(N):
num += b[i]
if num >= K:
print(a[i])
break
| import sys
N, K = (int(i) for i in input().split())
ab_list = [[int(i) for i in input().split()] for i in range(N)]
ab_list = sorted(ab_list, key=lambda ab: ab[0])
num = 0
for i in range(N):
num += ab_list[i][1]
if num >= K:
print(ab_list[i][0])
break | p03721 |
n, k = list(map(int, input().split()))
a = []
b = []
for i in range(n):
tmp1, tmp2 = list(map(int, input().split()))
a.append(tmp1)
b.append(tmp2)
p_list = []
t = list(zip(a, b))
ts = sorted(t)
a, b = list(zip(*ts))
for ai, bi in zip(a, b):
for i in range(bi):
p_list.append(ai)
print((p_list[k-1]))
| n, k = list(map(int, input().split()))
a = []
b = []
for i in range(n):
tmp1, tmp2 = list(map(int, input().split()))
a.append(tmp1)
b.append(tmp2)
p_list = []
t = list(zip(a, b))
ts = sorted(t)
a, b = list(zip(*ts))
ans = 0
count = 0
for ai, bi in zip(a, b):
count += bi
if count >= k:
ans = ai
break
print(ans)
| p03721 |
def main():
MAX = 100010
n,k = list(map(int,input().split()))
m = {}
for x in range(100010):
m[x] = 0
for x in range(n):
a,b = list(map(int,input().split()))
m[a] += b
if k == 0:
print((list(m.keys())[0]))
return
for key,value in list(m.items()):
k-=value
if k <= 0:
print(key)
return
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
class Scanner():
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [eval(input()) for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [int(eval(input())) for i in range(n)]
class Math():
@staticmethod
def gcd(a, b):
if b == 0:
return a
return Math.gcd(b, a % b)
@staticmethod
def lcm(a, b):
return (a * b) // Math.gcd(a, b)
@staticmethod
def roundUp(a, b):
return -(-a // b)
@staticmethod
def toUpperMultiple(a, x):
return Math.roundUp(a, x) * x
@staticmethod
def toLowerMultiple(a, x):
return (a // x) * x
@staticmethod
def nearPow2(n):
if n <= 0:
return 0
if n & (n - 1) == 0:
return n
ret = 1
while(n > 0):
ret <<= 1
n >>= 1
return ret
@staticmethod
def sign(n):
if n == 0:
return 0
if n < 0:
return -1
return 1
@staticmethod
def isPrime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
d = int(n ** 0.5) + 1
for i in range(3, d + 1, 2):
if n % i == 0:
return False
return True
class PriorityQueue:
def __init__(self, l=[]):
self.__q = l
heapq.heapify(self.__q)
return
def push(self, n):
heapq.heappush(self.__q, n)
return
def pop(self):
return heapq.heappop(self.__q)
sys.setrecursionlimit(1000000)
MOD = int(1e09) + 7
INF = int(1e30)
def main():
# sys.stdin = open("Sample.txt")
N, K = Scanner.map_int()
S = defaultdict(int)
for i in range(N):
a, b = Scanner.map_int()
S[a] += b
n = 0
for i in range(100001):
n += S[i]
if n >= K:
print(i)
return
return
if __name__ == "__main__":
main()
| p03721 |
xx = []
n, k = list(map(int, input().split()))
for i in range(n):
a, b = list(map(int, input().split()))
for j in range(b):
xx.append(a)
yy = sorted(xx)
print((yy[k-1]))
| xx = []
n, k = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(n)]
xx = sorted(ab, key= lambda x:x[0])
ans = 0
for i in range(n):
ans += xx[i][1]
if ans >= k:
print((xx[i][0]))
break | p03721 |
N,K = list(map(int,input().split()))
data = []
def insert(num,N,K):
x = 0
for i in range(N):
x += num[i][1]
if x >= K:
print((num[i][0]))
break
num = [list(map(int,input().split())) for i in range(N)]
num.sort(key=lambda x:x[0])
insert(num,N,K)
| N,K = list(map(int,input().split()))
data = []
def insert(num,N,K):
for i in range(N):
if num[i][1] >= K:
print((num[i][0]))
break
else:
K -= num[i][1]
num = [list(map(int,input().split())) for i in range(N)]
num.sort(key=lambda x:x[0])
insert(num,N,K)
| p03721 |
N, K = list(map(int,input().split()))
hairetu = []
for _ in range(N):
a, b = list(map(int,input().split()))
hairetu.extend([a]*b)
print((sorted(hairetu)[K-1])) | import sys
N, K = list(map(int,input().split()))
hairetu = []
for _ in range(N): hairetu.append(list(map(int,input().split())))
hairetu.sort()
cnt = 0
for i in range(N):
cnt += hairetu[i][1]
if K <= cnt:
print((hairetu[i][0]))
sys.exit() | p03721 |
def main():
N, K = (int(i) for i in input().split())
A = []
B = []
from bisect import bisect_left
AB = [[int(i) for i in input().split()] for j in range(N)]
AB.sort()
A = [a[0] for a in AB]
B = [a[1] for a in AB]
from itertools import accumulate
B = list(accumulate(B))
idx = bisect_left(B, K)
# print(A, B, idx)
print((A[idx]))
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.buffer.readline
N, K = (int(i) for i in input().split())
AB = [[int(i) for i in input().split()] for j in range(N)]
AB.sort()
cur = 0
for a, b in AB:
if cur+b < K:
cur += b
continue
else:
return print(a)
if __name__ == '__main__':
main()
| p03721 |
n, k = list(map(int, input().split()))
data = [10 ** 9]
for i in range(n):
a, b = list(map(int, input().split()))
temp = [a] * b
data.extend(temp)
rev = sorted(data)
#rev = data.reverse() > 大きい順
ans = rev[k - 1]
print(ans)
| n, k = list(map(int, input().split()))
'''
data = [10 ** 9]
for i in range(n):
a, b = map(int, input().split())
temp = [a] * b
data.extend(temp)
rev = sorted(data)
#rev = data.reverse() > 大きい順
ans = rev[k - 1]
print(ans)
>最大で（１０*＊１０）サイズリストになる。
バケツソートが必要。
（出現回数を格納したリストから、答えを出す。）
'''
data = [0] * (10 ** 5 + 1)
for i in range(n):
a, b = list(map(int, input().split()))
data[a] += b
count = 0
for i in range(1, 10 ** 5 + 1):
count += data[i]
if (count >= k):
ans = i
break
print(ans)
| p03721 |
#61c
N,K = list(map(int, input().split()))
array = []
for i in range(N):
a,b = list(map(int, input().split()))
array += [a for i in range(b)]
array.sort(reverse=False) #O( n・log(n) )
print((array[K-1])) | #61c
#import random #テスト用
N,K = list(map(int, input().split()))#N,K<=10**5 #Nのループで考えないとTLEしそう
#N = 100000 #test
a_b_dict = dict()
#b_sum = 0 #test
for i in range(N):
a,b = list(map(int, input().split()))
#a = random.randint(1, 100000) #test
#b = random.randint(1, 100000) #test
if a not in a_b_dict:
a_b_dict[a] = 0
a_b_dict[a] += b
#b_sum += b #test
a_b_dict_sorted = sorted(list(a_b_dict.items()), key=lambda x:x[0])
#K = random.randint(1, b_sum)
position = 0
for ab in a_b_dict_sorted:
b = ab[1]
position += b
if position >= K:
print((ab[0]))
break | p03721 |
N, K = list(map(int, input().split()))
a = [0]*N
b = [0]*N
c = [0]*N
for i in range(N):
a[i], b[i] = list(map(int, input().split()))
c[i] = i
c.sort(key=lambda i:a[i])
s = 0
for j in range(N):
s += b[c[j]]
if s>=K:
print(a[c[j]])
break | N, K = list(map(int, input().split()))
a = [0]*N
b = [0]*N
for i in range(N):
a[i], b[i] = list(map(int, input().split()))
sa = list(range(N))
sa.sort(key=lambda i:a[i])
c = 0
for i in range(N):
c += b[sa[i]]
if c >= K:
print(a[sa[i]])
break | p03721 |
n, k = list(map(int, input().split()))
ans = []
for i in range(n):
a, b = list(map(int, input().split()))
ans.append([a]*b)
ans = sorted(sum(ans, []))
print((ans[k-1]))
| n, k = list(map(int, input().split()))
dict_num = {}
for i in range(n):
a, b = list(map(int, input().split()))
if a in dict_num:
dict_num[a] += b
else:
dict_num[a] = b
array = []
for n, t in list(dict_num.items()):
array.append([n, t])
array.sort()
cnt = 0
for a in array:
cnt += a[1]
if cnt >= k:
print((a[0]))
break
| p03721 |
import sys
from collections import Counter
def solve():
N, K = list(map(int, input().split()))
cntr = Counter()
for i in range(N):
ai, bi = list(map(int, sys.stdin.readline().split()))
cntr[ai] += bi
cntr = sorted(cntr.items())
# print(cntr)
cnt = 0
for a, b in cntr:
cnt += b
if cnt >= K:
print(a)
return
if __name__ == '__main__':
solve() | import sys
def solve():
N, K = list(map(int, input().split()))
cnt = [0]*(10**5 + 1)
for i in range(N):
ai, bi = list(map(int, sys.stdin.readline().split()))
cnt[ai] += bi
tot = 0
for i, cnti in enumerate(cnt):
tot += cnti
if tot >= K:
print(i)
return
if __name__ == '__main__':
solve() | p03721 |
import bisect
N, K = list(map(int, input().split()))
AB = [tuple(map(int, input().split())) for _ in range(N)]
AB.sort(key=lambda x: x[0])
sumB = [0]
for a, b in AB:
sumB.append(sumB[-1] + b)
print((AB[bisect.bisect_left(sumB, K) - 1][0]))
| N, K = list(map(int, input().split()))
AB = [tuple(map(int, input().split())) for _ in range(N)]
AB.sort(key=lambda x: x[0])
sumB = 0
for a, b in AB:
sumB += b
if sumB >= K:
print(a)
break
| p03721 |
N, K = list(map(int, input().split()))
AB = [list(map(int, input().split())) for i in range(N)]
AB.sort()
result = []
count = 0
for a,b in AB:
min_k = min(b,K)
result += [a]*min_k
count += min_k
if count >= K:
break
print((result[K-1])) | N, K = list(map(int, input().split()))
AB = [list(map(int, input().split())) for i in range(N)]
AB.sort()
result = 0
for a,b in AB:
K -= b
result = a
if K <= 0:
break
print(result) | p03721 |
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
v=0
for i in range(k):
v+=ans[i]
if ans[i]==0:
i-=1
if v>=k:
a=i
break
print(a) | n,k=list(map(int,input().split()))
count=0
ba=[0]*(10**5+1)
for i in range(n):
a,b=list(map(int,input().split()))
ba[a]+=b
for i in range(len(ba)):
k-=ba[i]
if k<=0:
print(i)
break | p03721 |
n,k=list(map(int,input().split()))
ll=[list(map(int,input().split())) for i in range(n)]
l=[]
for i in ll:
for j in range(i[1]):
l.append(i[0])
l.sort()
print((l[k-1]))
| n, k = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(n)]
l = [0] * (10 ** 5 + 1)
for i in ab:
l[i[0]] += i[1]
s = 0
for i in range(10 ** 5 + 1):
s += l[i]
if s >= k:
print(i)
break
| p03721 |
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()
x=[]
for i in range(n):
x.extend([ab[i][0]]*ab[i][1])
if len(x)>k:
break
print((x[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()
c=0
for i in range(n):
c+=ab[i][1]
if c>=k:
print((ab[i][0]))
exit()
| p03721 |
n,k=list(map(int,input().split()))
L=[]
for s in range(n):
a,b=list(map(int,input().split()))
L.append((a,b))
#print(L)
L=sorted(L,key=lambda x:x[0])
#print(L)
sun=0
for s in L:
sun+=s[1]
if sun+1>k:
print((s[0]))
exit() | n,k=list(map(int,input().split()))
for s,t in sorted([list(map(int,input().split()))for i in range(n)],key=lambda x:x[0]):
if k>t:
k-=t
else:
print(s)
exit()
| p03721 |
n,k=list(map(int,input().split()))
for s,t in sorted([list(map(int,input().split()))for i in range(n)],key=lambda x:x[0]):
if k>t:
k-=t
else:
print(s)
exit()
| n,k=list(map(int,input().split()))
for a,b in sorted([list(map(int,input().split()))for i in range(n)],key=lambda x:x[0]):
if k>b:
k-=b
else:
print(a)
break
| p03721 |
l1=[]
l2=[]
n,k=list(map(int,input().split()))
for i in range(n):
l1.append(input().split())
for j in range(n):
for l in range(int(l1[j][1])):
l2.append(int(l1[j][0]))
l2.sort()
print((l2[k-1])) | l1=[]
ret=0
c=0
n,k=list(map(int,input().split()))
for i in range(n):
l1.append(input().split())
num=[0]*(10**5)
for j in range(n):
num[int(l1[j][0])-1]+=int(l1[j][1])
#print(num)
for l in range(10**5):
if num[l]>=k:
print((l+1))
break
k-=num[l] | p03721 |
N,K = list(map(int,input().split()))
list1 = []
for i in range(N):
a,b = list(map(int,input().split()))
list2 = [a]*b
list1 += list2
list1.sort()
print((list1[K-1])) | N,K = list(map(int,input().split()))
list1 = []
for i in range(N):
list1.append(list(map(int,input().split())))
list1.sort()
list2 = []
for j in range(N):
list2 += [list1[j][0]]*list1[j][1]
if len(list2) >= K:
break
print((list2[K-1])) | p03721 |
N,K = list(map(int,input().split()))
list1 = []
for i in range(N):
list1.append(list(map(int,input().split())))
list1.sort()
list2 = []
for j in range(N):
list2 += [list1[j][0]]*list1[j][1]
if len(list2) >= K:
break
print((list2[K-1])) | N,K = list(map(int,input().split()))
list1 = []
for i in range(N):
list1.append(list(map(int,input().split())))
num = [0]*(10**5+1)
for j in range(N):
num[list1[j][0]] += list1[j][1]
c = 0
d = 0
for k in range(10**5+1):
c += num[k]
if c >= K:
d = k
break
print(d) | p03721 |
N, K = list(map(int, input().split()))
A = []
for i in range(N):
a, b = list(map(int, input().split()))
for k in range(b):
A.append(a)
A.sort()
print((A[K-1])) | N, K = list(map(int, input().split()))
A = [0 for _ in range(10 ** 5)]
for i in range(N):
a, b = list(map(int, input().split()))
A[a - 1] += b
for i in range(10 ** 5):
if K - A[i] > 0:
K = K - A[i]
else:
print((i + 1))
break | p03721 |
def resolve():
n, k = list(map(int, input().split()))
arr = [0]*(10**5+1)
for i in range(n):
a, b = list(map(int, input().split()))
arr[a] += b
for i in range(len(arr)):
if arr[i] >= k:
print(i)
break
k -= arr[i]
resolve() | def resolve():
n, k = list(map(int, input().split()))
B = [0]*10**5
for _ in range(n):
a, b = list(map(int, input().split()))
B[a-1] += b
cnt = 0
for i in range(len(B)):
cnt += B[i]
if cnt >= k:
print((i+1))
break
resolve() | p03721 |
N, K = list(map(int, input().split()))
a = []
b = []
hairetu = []
for i in range(N):
A, B = list(map(int, input().split()))
h = [A for i in range(B)]
hairetu.extend(h)
hairetu.sort()
print((hairetu[K-1]))
| N, K = list(map(int, input().split()))
a = []
b = []
hairetu = []
for i in range(N):
A, B = list(map(int, input().split()))
hairetu.append([A, B])
hairetu.sort()
for i in range(N):
K -= hairetu[i][1]
if K <= 0:
print((hairetu[i][0]))
break
| p03721 |
N, K = list(map(int, input().split()))
li = [list(map(int, input().split())) for n in range(N)]
a = []
for i in li:
b = [i[0]] * i[1]
a.extend(b)
a.sort()
print((a[K-1])) | from collections import defaultdict
d = defaultdict(int)
N, K = list(map(int, input().split()))
li = [list(map(int, input().split())) for n in range(N)]
for i in li:
d[i[0]] += i[1]
count = 0
new = sorted(d)
for i in new:
count += d[i]
if count >= K:
print(i)
break | p03721 |
# -*- coding: utf-8 -*-
import sys
import os
import math
N, K = list(map(int, input().split()))
A = []
for i in range(N):
a, b = list(map(int, input().split()))
A += [a] * b
A.sort()
print((A[K-1])) | # -*- coding: utf-8 -*-
import sys
import os
import math
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()
i = 0
cnt = 0
for a in A:
v = a[0]
num = a[1]
cnt += num
if cnt >= K:
print(v)
break | p03721 |
import sys
input = sys.stdin.readline
n,k=list(map(int,input().split()))
ab=[list(map(int,input().split())) for _ in range(n)]
ab.sort()
l=[]
m=0
for i in range(len(ab)):
for j in range(ab[i][1]):
l.append(ab[i][0])
m+=1
if m>k:break
print((l[k-1])) | import sys
input = sys.stdin.readline
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
m=0
for i in range(10**5):
if m+l[i]>=k:print((i+1));break
else: m+=l[i] | p03721 |
N,K = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(N)]
l = []
for a,b in AB:
ab = [a]*b
l.extend(ab)
l.sort()
print((l[K-1])) | N,K = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(N)]
count = 0
AB.sort()
for a,b in AB:
count += b
if count >= K:
print(a)
exit() | p03721 |
ans = []
n,k = list(map(int, input().split()))
for i in range(n):
a, b = list(map(int, input().split()))
ans.extend([a for _ in range(b)])
ans.sort()
print((ans[k-1])) | from collections import defaultdict
ans = defaultdict(int)
n,k = list(map(int, input().split()))
for i in range(n):
a, b = list(map(int, input().split()))
ans[a] += b
ord = 0
for key in sorted(ans.keys()):
ord += ans[key]
if(ord >= k):
print(key)
exit() | p03721 |
N, K = list(map(int,input().split()))
l = []
for i in range(N):
a, b = list(map(int, input().split()))
l += [a] * b
print((sorted(l)[K-1])) | N, K = list(map(int,input().split()))
l = []
for i in range(N):
a, b = list(map(int, input().split()))
l.append((a,b))
def c(x):
return x[0]
l = sorted(l, key=c)
t = 0
for a,b in l:
t2 = t
t += b
if t2 <= K and t >= K:
break
print(a) | p03721 |
[n,k]=list(map(int,input().split()))
ablist=[]
suretu=[]
for i in range(n):
ab=list(map(int,input().split()))
suretu+=[ab[0]]*ab[1]
suretu=sorted(suretu)
print((suretu[k-1])) | [n,k]=list(map(int,input().split()))
ablist=[]
for i in range(n):
ablist.append(list(map(int,input().split())))
ablist=sorted(ablist,key=lambda x:x[0])
bwa=[0]
for i in range(n):
bwa.append(bwa[-1]+ablist[i][1])
ind=1
while True:
if bwa[ind-1]<k<=bwa[ind]:
break
ind+=1
print((ablist[ind-1][0])) | p03721 |
N, K = list(map(int, input().split()))
array = []
for i in range(N):
a, b = list(map(int, input().split()))
array += [a]*b
array.sort()
print((array[K-1]))
| N, K = list(map(int, input().split()))
abn = [list(map(int, input().split())) for _ in range(N)]
abn.sort()
pool = 0
for ab in abn:
pool += ab[1]
if pool >= K:
print((ab[0]))
break
| p03721 |
#!/usr/bin/python3
# abc061_c
"""
Big Array
"""
test = False
def answer():
"""
答えを出力する関数
"""
l_1 = []
l_2 = []
N, K = list(map(int, input().split()))
for _ in range(N):
l_1.append(list(map(int, input().split())))
l_1.sort()
if test:
print(l_1)
for v in l_1:
l_2.extend([v[0]] * v[1])
# 小さい順にソートして、K-1番目の要素を出力
if test:
print(l_2)
print((l_2[K-1]))
def main():
"""
処理を実行する関数
"""
answer()
if __name__ == '__main__':
main()
| #!/usr/bin/python3
# abc061_c
"""
Big Array
"""
def answer():
"""
答えを出力する関数
"""
l = []
N, K = list(map(int, input().split()))
counter = 0
for _ in range(N):
l.append(list(map(int, input().split())))
l.sort()
for v in l:
counter += v[1]
if counter >= K:
print((v[0]))
break
def main():
"""
処理を実行する関数
"""
answer()
if __name__ == '__main__':
main()
| p03721 |
nums = [int(x) for x in input().split()]
N = nums[0]
K = nums[1]
arr = []
for i in range(N):
nums = [int(x) for x in input().split()]
for j in range(nums[1]):
arr.append(nums[0])
arr.sort()
print((arr[K-1])) | nums = [int(x) for x in input().split()]
N = nums[0]
K = nums[1]
arr = []
for i in range(N):
nums = [int(x) for x in input().split()]
arr.append(tuple(nums))
arr = sorted(arr, key=lambda x: x[0])
vol = 0
for i in range(len(arr)):
vol = vol + arr[i][1]
if vol >= K:
print((arr[i][0]))
break | p03721 |
def C(_mid):
if _mid <= target_list[K - 1]:
return True
else:
return False
N, K = list(map(int, input().split()))
target_list = []
ab = []
for i in range(N):
a, b = list(map(int, input().split()))
ab.append([a, b])
ab.sort(key=lambda x: x[0])
# print(ab)
for i in range(N):
for j in range(ab[i][1]):
target_list.append(ab[i][0])
# print(target_list)
lb = 1
ub = 100000
while ub - lb > 1:
# print(str(lb) + " " + str(ub))
mid = int((lb + ub) / 2)
if C(mid):
lb = mid
else:
ub = mid
print(lb)
| def C(_mid):
tmp_sum = 0
if len(ab) <= _mid:
return False
for i in range(0, _mid):
tmp_sum += ab[i][1]
if tmp_sum < K:
return True
else:
return False
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(key=lambda x: x[0])
lb = 0
ub = 100000
while ub - lb > 1:
# print(str(lb) + " " + str(ub))
mid = int((lb + ub) / 2)
if C(mid):
lb = mid
else:
ub = mid
print((ab[lb][0]))
| p03721 |
N, K = list(map(int,input().split()))
l = list()
for n in range(N):
listA=list(map(int,input().split()))
for i in range(listA[1]):
l.append(int(listA[0]))
print((sorted(l)[K-1])) | N, K = list(map(int,input().split()))
l = list()
c = 0
ans = 0
ab_list = list()
for n in range(N):
a,b =list(map(int,input().split()))
ab_list.append([a,b])
ab_list = sorted(ab_list, key=lambda x: x[0])
for a,b in ab_list:
c += b
if c >= K:
ans = a
break
print(ans) | p03721 |
N, K = list(map(int, input().split()))
array = []
for i in range(N):
a, b = list(map(int, input().split()))
array.extend([a]*b)
array.sort()
print((array[K- 1])) | N, K = list(map(int, input().split()))
array = [0]*(10**5+ 1)
for i in range(N):
a, b = list(map(int, input().split()))
array[a]+= b
S = 0
i = 0
while S < K:
S+= array[i]
i+= 1
print((i- 1)) | p03721 |
def main2():
n,k = list(map(int,input().split(" ")))
q = []
for i in range(n):
a,b = list(map(int,input().split(" ")))
q+=[a for j in range(b)]
q.sort()
print((q[k-1]))
main2() |
def main2():
import heapq
n,k = list(map(int,input().split(" ")))
q = []
for i in range(n):
a,b = list(map(int,input().split(" ")))
heapq.heappush(q,(a,b))
while k>0:
a,b = heapq.heappop(q)
k-=b
print(a)
main2() | p03721 |
n,k=list(map(int,input().split()))
lst=sorted([list(map(int,input().split())) for _ in range(n)])
cnt=0
sm=0
for i in range(n):
if sm<k:
cnt+=1
sm+=lst[i][1]
print((lst[cnt-1][0])) | n,m=list(map(int,input().split()))
cnt=0
lst=sorted([list(map(int,input().split())) for _ in range(n)])
#print(lst)
i=0
while cnt<m:
cnt+=lst[i][1]
if cnt<m:
i+=1
print((lst[i][0]))
| p03721 |
N,K = list(map(int,input().split()))
AB =[]
for n in range(N):
a,b = list(map(int,input().split()))
AB.extend([a]*b)
print((sorted(AB)[K-1])) | N,K = list(map(int,input().split()))
AB =[]
for n in range(N):
a,b = list(map(int,input().split()))
AB.append([a,b])
AB.sort(key=lambda x:x[0])
cnt = 0
for i,a in enumerate(AB):
if cnt < K:
cnt +=a[1]
if cnt >=K:
print((a[0]))
exit() | p03721 |
n, k = list(map(int, input().split()))
AB = sorted([list(map(int, input().split())) for _ in range(n)], key=lambda x:x[0])
for a, b in AB:
k -= b
if k <= 0:
print(a)
break | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
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])
for i in range(n):
a, b = AB[i]
if b < k:
k -= b
else:
print(a)
break
if __name__ == '__main__':
resolve()
| p03721 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.