s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s465325034 | p03721 | u257442624 | 1588562855 | Python | Python (3.4.3) | py | Runtime Error | 31 | 3964 | 203 | N, K = map(int, input().split())
c = []
for _ in range(N):
a, b= map(int, input().split())
for i in range(b):
c.append(a)
if d <= len(c):
break
print(sorted(c)[K-1]) |
s514674450 | p03721 | u257442624 | 1588562485 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 210 | ## N, K = map(int, input().split())
c = []
d = 0
for _ in range(N):
a, b= map(int, input().split())
for i in range(b):
c.append(a)
d += b
if d <= K-1:
break
print(sorted(c)[K-1]) |
s572174986 | p03721 | u257442624 | 1588561356 | Python | Python (3.4.3) | py | Runtime Error | 2229 | 1970908 | 167 | import numpy as np
N, K = map(int, input().split())
d = []
for _ in range(N):
a, b= map(int, input().split())
c = [a] * b
d.append(c)
print(sorted(c)[K-1]) |
s728495212 | p03721 | u401487574 | 1588543085 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 164 | ma = lambda:map(int,input().split())
n,k = ma()
ab = []
for i in range(n):
ab.append((list(ma)))
ab.sort()
c = 0
for a,b in ab:
c+=b
if c>=k:print(a)
|
s241464005 | p03721 | u378284889 | 1588133099 | Python | Python (3.4.3) | py | Runtime Error | 410 | 12188 | 287 | N,K=(int(x) for x in input().split())
a_list=[]
b_list=[]
for i in range(N):
a,b=(int(x) for x in input().split())
a_list.append(a)
b_list.append(b)
none_list=[]
for i in range(N):
_append=a_list[i]*b_list[i]
none_list.append(a_list[i])
none_list.sort()
print(none_list[K-1]) |
s729235782 | p03721 | u078349616 | 1587597467 | Python | Python (3.4.3) | py | Runtime Error | 3814 | 989828 | 147 | N, K = map(int, input().split())
A, B = [0]*N, [0]*N
s = ""
for i in range(N):
A[i], B[i] = input().split()
s += A[i] * int(B[i])
print(s[K-1]) |
s003006551 | p03721 | u535659144 | 1586637719 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38640 | 1381 | def cnct(lint,lim):
global list753
global list357
global list333
lint1=str(lint)+"3"
lint1int=int(lint1)
if lint1int<=lim and not lint1int in list357:
list357.add(lint1int)
cnct(lint1int,lim)
lint2=str(lint)+"5"
lint2int=int(lint2)
if lint2int<=lim and not lint2int in... |
s871117376 | p03721 | u535659144 | 1586637663 | Python | PyPy3 (2.4.0) | py | Runtime Error | 176 | 39024 | 1381 | def cnct(lint,lim):
global list753
global list357
global list333
lint1=str(lint)+"3"
lint1int=int(lint1)
if lint1int<=lim and not lint1int in list357:
list357.add(lint1int)
cnct(lint1int,lim)
lint2=str(lint)+"5"
lint2int=int(lint2)
if lint2int<=lim and not lint2int in... |
s931660702 | p03721 | u535659144 | 1586627867 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 146 | %%cython
n,k=map(int,input().split())
listn=[]
for a in range(n):
b,c=map(int,input().split())
listn+=[b]*c
listn.sort()
print(listn[k-1]) |
s726079816 | p03721 | u102242691 | 1584763207 | Python | Python (3.4.3) | py | Runtime Error | 365 | 11516 | 255 |
n,k = map(int,input().split())
count = [0]* (10**5+1)
s = set()
for i in range(n):
a,b = map(int,input().split())
count[a-1] += b
s.add(a)
print(s)
x = 0
for s in sorted(S):
x += count[s-1]
if x >= k:
print(s)
break
|
s890533323 | p03721 | u457554982 | 1584641959 | Python | Python (3.4.3) | py | Runtime Error | 2212 | 1667068 | 192 | [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]
ablist.append(ab)
suretu.sort()
print(sort[k-1]) |
s360016710 | p03721 | u753542444 | 1584506402 | Python | Python (3.4.3) | py | Runtime Error | 531 | 37940 | 219 | import numpy as np
num, rank = map(int,input().split())
grid = []
for i in range(num):
array = list(map(int, input().strip().split()))
grid.append(array)
list = np.ravel(grid)
list.sort()
print(list[rank-1]) |
s263525028 | p03721 | u753542444 | 1584506244 | Python | Python (3.4.3) | py | Runtime Error | 251 | 18080 | 209 | import numpy as np
num = int(input().strip())
grid = []
for i in range(num):
array = list(map(int, input().strip().split()))
grid.append(array)
list = np.ravel(grid)
list.sort()
print(list[num-1])
|
s952117084 | p03721 | u672898046 | 1584489413 | Python | Python (3.4.3) | py | Runtime Error | 2482 | 2035840 | 144 | N, K = map(int, input().split())
s = ""
for _ in range(N):
a,b = map(int, input().split())
s += (str(a)+" ")*b
print(sorted(s.split())[K-1]) |
s577766553 | p03721 | u841623074 | 1584214067 | Python | Python (3.4.3) | py | Runtime Error | 1836 | 15220 | 341 | N,K=map(int,input().split())
a=[0]*N
b=[0]*N
for i in range(N):
a[i],b[i]=map(int,input().split())
count=0
import collections
while K>0:
c=min(a)
array=[]
for i,x in enumerate(a):
if a[i]==c:
K-=b[i]
array.append(i)
for i in array:
a.pop(array[i])
b.p... |
s046867687 | p03721 | u336093806 | 1584201022 | Python | Python (3.4.3) | py | Runtime Error | 506 | 27872 | 205 | N, M = map(int,input().split())
P = [list(map(int,input().split())) for i in range(N)]
P1 = P.sort()
a = 0
for i in range(N):
if M < P[i][1]:
break
M = M-P[i][1]
a += 1
print(P[a][0]) |
s629240330 | p03721 | u246217175 | 1583978480 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 250 | def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
n = int(input())
t = [0]*n
for i in range(n):
t[i] = int(input())
ans = t[0]
for i in range(1,n):
ans = ans * t[i] // gcd(ans , t[i])
print(ans) |
s049928818 | p03721 | u175590965 | 1583550753 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 173 | n,k = map(int(input().split()))
ab = [list(map(int,input().split()))for i in range(n)]
ab.sort()
i = 0
c = ab[0][1]
while c < k:
i +=1
c += ab[i][1]
print(ab[i][0]) |
s470205878 | p03721 | u175590965 | 1583550372 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 194 | n,k = map(int(input().split()))
ab = [list(map(int,input().split()))for i in range(n)]
ab.sort()
c = 0
for i in range(n):
c += ab[i][1]
if c >= k:
print(ab[i][0])
exit() |
s939436418 | p03721 | u105302073 | 1583021674 | Python | Python (3.4.3) | py | Runtime Error | 2242 | 1738096 | 259 | n, k = [int(i) for i in input().split()]
d = {}
for i in range(n):
a, b = [int(i) for i in input().split()]
if a in d:
d[a] += b
else:
d[a] = b
c = []
for k, v in sorted(d.items(), key=lambda x: x[0]):
c += [k] * v
print(c[k])
|
s327766445 | p03721 | u995062424 | 1582767760 | Python | Python (3.4.3) | py | Runtime Error | 377 | 13360 | 160 | N, K = map(int, input().split())
L = []
for i in range(N):
a, b = map(int, input().split())
L.append(a)
L.append(b)
L = sorted(L)
print(L[K+1]) |
s627538352 | p03721 | u934788990 | 1582203477 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 199 | n,k = map(int,input().split())
ab= []
ans = 0
for i in range(n):
ab = list(map(int,input().split()))
ab.append(count)
ab.sort()
while ans < k:
ans +=ab[i][1]
i +=1
print(ab[i-1][0]) |
s549710300 | p03721 | u404290207 | 1581522832 | Python | PyPy3 (2.4.0) | py | Runtime Error | 495 | 84988 | 1302 | import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect... |
s548102884 | p03721 | u875600867 | 1581198967 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 140 | N, K = map(int, input().split())
l=[]
for n in range(N):
a,b = input().split()
l.append(list[a*int(b)])
l.sort()
print(l[K-1]) |
s353341053 | p03721 | u488401358 | 1580915873 | Python | Python (3.4.3) | py | Runtime Error | 357 | 20720 | 231 | N,K=map(int,input().split())
a =[0]*N
b =[0]*N
for i in range(0,N):
a[i],b[i] =map(int,input().split())
c=[0]*(10**6)
for i in range(0,N):
c[a[i]]=c[a[i]]+b[i]
s=0
i=1
while s<K:
s=s+c[i]
x=a[i-1]
i=i+1
print(x) |
s530725839 | p03721 | u378782369 | 1580785592 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 230 | N, K = input().split()
N = int(N)
K = int(K)
proList = []
for n in range(N):
a, b = input(),split()
a = int(a)
b = int(b)
for times in range(b):
proList.append(int(a))
sortList = sorted(proList)
print(sortList[K-1]) |
s654160853 | p03721 | u309141201 | 1579130315 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 360 | n, k = map(int, input().split())
a = [0] * n
b = [0] * n
sum = 0
arr = []
for i in range(n):
a[i], b[i] = map(int, input().split())
arr_list = list(zip(a, b))
arr_list = sorted(arr_list)
# print(arr_list)
for i in range(n):
sum += arr_list[i][1]
# print(sum, arr_list[i])
if sum >= k:
answer = a... |
s815096004 | p03721 | u579155306 | 1578529328 | Python | Python (3.4.3) | py | Runtime Error | 307 | 11064 | 316 | N,K = [int(i) for i in input().split(" ")]
a = []
b = []
for n in range(N):
temp = [int(i) for i in input().split(" ")]
a.append(temp[0])
b.append(temp[1])
point = 0
while 1:
Index = index(min(a))
point += b[Index]
if K <=point:
break
else:
a.pop(Index)
b.pop(Index)
print(a[Index])
|
s816784205 | p03721 | u348868667 | 1578500550 | Python | Python (3.4.3) | py | Runtime Error | 3130 | 697076 | 200 | N,K = map(int,input().split())
ls = []
len = 0
for i in range(N):
a,b = map(int,input().split())
ls.append(str(a)*b)
len += b
if len >= K:
break
ls = "".join(ls)
print(ls[K-1]) |
s658995351 | p03721 | u417014669 | 1576857091 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 237 | a,b=map(int,input())
s=[]
for i in(range(a)):
a,b=map(int,input().split())
s=[]
for i in(range(a)):
x,y=map(int, input().split())
s.append([x]*y)
one_s=[ flatten for inner in s for flatten in inner]
print(sorted(one_s)[b-1]) |
s811711746 | p03721 | u540761833 | 1576701140 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3060 | 139 | n = int(input())
array = []
for i in range(1,n+1):
for j in range(1,n//i+1):
array.append(abs(i-j) + n - i*j)
print(min(array)) |
s883522274 | p03721 | u780475861 | 1575751703 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 243 | input = sys.stdin.readline
n, k = map(int,input().split())
lst = [[int(i) for i in input().split()] for _ in range(n)]
lst.sort(key = lambda x: x[0])
for [i, j] in lst:
if j >= k:
print(i)
quit()
else:
k -= j |
s053035564 | p03721 | u836737505 | 1575153860 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 165 | N,K=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()
|
s902749138 | p03721 | u836984617 | 1574979285 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 260 | n, k = map(int, input().split())
a = []
b = []
for i in range(n):
l = list(map(int, input().split()))
a.append(l[0])
b.append(l[1])
s = []
for i in range(n):
s.extend([a[i]] * b[i])
for i in range(3):
s.remove(min(s)
print(s)
|
s230373364 | p03721 | u668503853 | 1574919084 | Python | Python (3.4.3) | py | Runtime Error | 338 | 7388 | 165 | N,K=map(int,input().split())
li=[]
k=K
for i in range(N):
a,b=map(int,input().split())
K-=b
li.append(a)
if K<=0:
li.sort()
print(li[k-1])
exit() |
s767649638 | p03721 | u668503853 | 1574919022 | Python | Python (3.4.3) | py | Runtime Error | 335 | 7388 | 161 | N,K=map(int,input().split())
li=[]
for i in range(N):
a,b=map(int,input().split())
K-=b
li.append(a)
if K<=0:
li.sort()
print(li[K-1])
exit() |
s392062298 | p03721 | u183840468 | 1573659601 | Python | Python (3.4.3) | py | Runtime Error | 455 | 30124 | 265 | import numpy as np
n,m = [int(i) for i in input().split()]
l = [[int(i) for i in input().split()] for _ in range(n)]
ans = np.zeros(10**10+100,dtype = np.int64)
start = 0
end = 0
for i,j in l:
end += j
ans[start:end] = i
start = end
print(ans[m-1]) |
s180654828 | p03721 | u183840468 | 1573658894 | Python | Python (3.4.3) | py | Runtime Error | 662 | 30888 | 263 | import numpy as np
n,m = [int(i) for i in input().split()]
l = [[int(i) for i in input().split()] for _ in range(n)]
ans = np.zeros(10**5+1,dtype = np.int64)
start = 0
end = 0
for i,j in l:
end += j
ans[start:end] = i
start = end
print(ans[m-1]) |
s752816761 | p03721 | u183840468 | 1573658868 | Python | Python (3.4.3) | py | Runtime Error | 305 | 21156 | 243 | n,m = [int(i) for i in input().split()]
l = [[int(i) for i in input().split()] for _ in range(n)]
ans = np.zeros(10**5+1,dtype = np.int64)
start = 0
end = 0
for i,j in l:
end += j
ans[start:end] = i
start = end
print(ans[m-1]) |
s121207891 | p03721 | u716529032 | 1573314971 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 280 | n, k = map(int,input().split())
result = float("Inf")
length = 0
for i in range(N):
a, b = map(int,input().split())
if(length < k):
length += b
result = max(result, a)
else:
if(a < result):
length += b
if(length > k):
result = a
print(result) |
s408551294 | p03721 | u940061594 | 1573080352 | Python | Python (3.4.3) | py | Runtime Error | 328 | 13680 | 278 | #Big Array
N, K = map(int, input().split())
a = [0]*N
b = [0]*N
R = [0]*(10**5)
ans = 0
for i in range(N):
a[i], b[i] = map(int, input().split())
for i in range(N):
R[a[i]] = R[a[i]] + b[i]
j = 0
while K > 0:
K = K - R[j]
ans = ans + 1
j = j + 1
print(ans-1) |
s724854249 | p03721 | u117348081 | 1573058862 | Python | Python (3.4.3) | py | Runtime Error | 506 | 20100 | 198 | n,k = map(int, input().split())
p = [[0,0]]
for i in range(n):
a,b = map(int, input().split())
p.append([a,b])
p.sort()
ans = 0
i = 0
while ans<=k:
ans+=p[i][1]
i+=1
print(p[i-1][0]) |
s158980029 | p03721 | u117348081 | 1573058791 | Python | Python (3.4.3) | py | Runtime Error | 461 | 20104 | 198 | n,k = map(int, input().split())
p = [[0,0]]
for i in range(n):
a,b = map(int, input().split())
p.append([a,b])
p.sort()
ans = 0
i = 0
while ans<=k:
ans+=p[i+1][1]
i+=1
print(p[i][0]) |
s045817540 | p03721 | u254871849 | 1572651029 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 320 | import sys
input = 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() |
s391970403 | p03721 | u153902122 | 1572320789 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 229 | N,K=map(int,input().split())
ans=[0]*10**13
for i in range(N):
a,b=map(int,input().split())
ans[a]+=b
for i in range(len(ans)):
cnt+=ans[i]
if cnt<K:
continue
else:
print(ans[i])
exit() |
s979451601 | p03721 | u644907318 | 1571748455 | Python | Python (3.4.3) | py | Runtime Error | 365 | 14732 | 284 | N,K = map(int,input().split())
C = {}
A = []
for _ in range(N):
a,b = map(int,input().split())
if a not in C:
C[a] = 0
C[a] += b
A.append(a)
A = sorted(list(set(A)))
cnt = 0
for i in range(len(A)):
cnt += C[i]
if cnt>=K:
print(i)
break
|
s564415113 | p03721 | u753803401 | 1569203319 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38256 | 341 | def slove():
import sys
input = sys.stdin.readline
n, k = list(map(int, input().rstrip('\n').split()))
ab = sorted([ist(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__ == '__... |
s175799449 | p03721 | u785470389 | 1569095956 | Python | Python (3.4.3) | py | Runtime Error | 347 | 5740 | 240 | n, k = map(int, input().split())
num = [0] * 100000
for i in range(n):
a, b = map(int, input().split())
num[a - 1] += b
for i in range(100000 - 1):
if num[i] > 0:
k -= num[i]
if k <= 0:
ans = i + 1
break
print(ans) |
s120567483 | p03721 | u753803401 | 1568938989 | Python | PyPy3 (2.4.0) | py | Runtime Error | 177 | 38256 | 340 | def slove():
import sys
input = sys.stdin.readline
n, k = list(map(int, input().rstrip('\n').split()))
ab = [ist(map(int, input().rstrip('\n').split()))]
ab.sort()
t = 0
mt = 0
for a, b in ab:
t += b
if t >= k:
print(a)
exit()
if __name__ == '__m... |
s756337083 | p03721 | u661983922 | 1568214172 | Python | Python (3.4.3) | py | Runtime Error | 378 | 5864 | 223 | 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
for j in range(1,int(len(l))+1):
if K >= l[j]:
K -= l[j]
else:
print(j)
break |
s301398190 | p03721 | u901582103 | 1568160527 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 189 | n,k=map(int,input().split())
A=[]
for i in range(n):
a=list(map(int,input().split()))
A.append(a)
S=sorted(A,key=lambda,x:x[0])
i=0
while k>0:
k-=A[i][1]
i+=1
print(A[i][0]) |
s192894711 | p03721 | u901582103 | 1568159891 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 189 | n,k=map(int,input().split())
A=[]
for i in range(n):
a=list(map(int,input().split()))
A.append(a)
S=sorted(A,key=lambda,x:x[0])
i=0
while k>0:
k-=a[i][1]
i+=1
print(a[i][0]) |
s229333959 | p03721 | u598229387 | 1567890354 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 289 |
n,k=map(int,input().split())
ab=[[int(i) for i in input().split()]for j in range(n)]
dic={}
for a,b in ab:
if a in dic:
dic[a]+=j
else:
dic[a]=j
dic=sorted(dic.items() , key=lambda x:x[0])
check=0
for i,j in dic:
check+=j
if check>=k
print(i)
break |
s780482839 | p03721 | u871841829 | 1567780333 | Python | Python (3.4.3) | py | Runtime Error | 377 | 10864 | 336 | from collections import defaultdict
N, K = list(map(int, input().split()))
nval = defaultdict(int)
for _ in range(N):
a, b = list(map(int, input().split()))
nval[a] += b
keys = nval.keys()
sorted(keys)
cnt = 0
for val in keys:
# cnt += nval[val]
if K <= nval[val]:
print(val)
break
... |
s020184553 | p03721 | u896741788 | 1567544704 | Python | Python (3.4.3) | py | Runtime Error | 455 | 27872 | 167 | n,k=map(int,input().split())
l=[list(map(int,input().split())) for _ in range(n)].sort()
cou=0
for r in l:
a,b=r[0],r[1]
cou+=b
if cou>=k:
print(a)
break |
s260139414 | p03721 | u896741788 | 1567544658 | Python | Python (3.4.3) | py | Runtime Error | 510 | 27872 | 155 | n,k=map(int,input().split())
l=[list(map(int,input().split())) for _ in range(n)].sort()
cou=0
for [a,b] in l:
cou+=b
if cou>=k:
print(a)
break |
s668037217 | p03721 | u437638594 | 1566082756 | Python | Python (3.4.3) | py | Runtime Error | 397 | 49556 | 175 | N, K = map(int, input().split())
ab_list = sorted([map(int, input().split()) for _ in range(N)])
for a, b in ab_list:
if b >= K:
print(a)
exit()
else:
K -= b
|
s547779057 | p03721 | u716043626 | 1566069358 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 163 | n, k = map(int,input().split())
count = 0
for i in range(n):
a,b = map(int,input().split())
count += b
if count >= k:
print(a)
break() |
s383105338 | p03721 | u904804404 | 1565440892 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 207 | N,K=list(map(int,input().split()))
AB =sorted([tuple(map(int,input().split())) for i in range(N)],key=lambda x:-x[0])
B=1
for a,b in AB:
a,b=tuple(map(int,
if B>=K :
print(a)
quit()
B+=b
|
s111402340 | p03721 | u722189950 | 1564936751 | Python | Python (3.4.3) | py | Runtime Error | 2648 | 359584 | 221 | #ABC061C
N, K = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(N)]
cnt = 0
ans = ""
for a, b in ab:
ans += str(a) * b
cnt += b
if cnt >= K:
print(ans[-1])
break |
s388795129 | p03721 | u777283665 | 1564893825 | Python | Python (3.4.3) | py | Runtime Error | 2077 | 987140 | 137 | n, k = map(int,input().split())
ab = [input().split() for i in range(n)]
ans = ""
for i in ab:
ans += i[0] * int(i[1])
print(ans[k]) |
s070506434 | p03721 | u626337957 | 1564850331 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 221 | N, K = int(input())
opes = []
for _ in range(N):
opes.append(tuple(map(int, input().split())))
opes.sort(key=lambda x:x[0])
sum_ope = 0
for ope in opes:
sum_ope += ope[1]
if sum_ope >= K:
print(ope[0])
break |
s263359467 | p03721 | u600402037 | 1564118157 | Python | Python (3.4.3) | py | Runtime Error | 302 | 5748 | 228 | N, K = list(map(int, input().split()))
l = [0] * 10 ** 5
for i in range(N):
a, b = map(int, input().split())
l[a] += b
count = 0
for j in range(10**5):
count += l[j]
if count >= K:
print(j)
break
|
s449312938 | p03721 | u821432765 | 1564068631 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 170 | n, k = [int(i) for i in input().split()]
m = sorted([[int(i) for i in input().split()] for _ in range(n)]
s=0
i=0
while s<k:
s += m[i][1]
i += 1
print(m[i-1][0]) |
s134853728 | p03721 | u919633157 | 1563914504 | Python | Python (3.4.3) | py | Runtime Error | 201 | 14692 | 331 | from heapq import heappop,heappush
input=open(0).readline
n,k=map(int,input().split())
res={}
for i in range(n):
a,b=map(int,input().split())
res[a]=res.get(a,0)+b
que=[]
for key,val in res.items():
heappush(que,(key,val))
while k:
key,val=heappop(que)
if val<=k:
print(key)
exit()... |
s981487213 | p03721 | u170324846 | 1563844708 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38512 | 327 | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, K, a, b, S, ans;
cin >> N >> K;
vector<int> C(100000);
for (int i = 0; i < N; i++){
cin >> a >> b;
C.at(a-1) += b;
}
for (int i = 0; i < N; i++){
S += C.at(i);
if (S >= K){
cout << i+1 << endl;
break;
... |
s148213779 | p03721 | u423585790 | 1563570726 | Python | PyPy3 (2.4.0) | py | Runtime Error | 296 | 42988 | 1659 | #!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): re... |
s631206399 | p03721 | u423585790 | 1563570697 | Python | PyPy3 (2.4.0) | py | Runtime Error | 290 | 42348 | 1698 | #!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): re... |
s340112514 | p03721 | u779455925 | 1562056897 | Python | Python (3.4.3) | py | Runtime Error | 415 | 29856 | 282 | [[print(ab[[index for index in [SumI if NK[1]<=sum([ab[1][I] for I in range(SumI)]) else -1 for SumI in range(NK[0])] if index!=-1][0]][0]) for ab in [sorted([list(map(int,(input().split()))) for i in range(NK[0])],key=lambda x:x[0])]] for NK in [list(map(int,(input().split())))]]
|
s962631902 | p03721 | u820047642 | 1561843455 | Python | Python (3.4.3) | py | Runtime Error | 342 | 14732 | 239 | N,K=map(int,input().split())
D,L={},[]
for _ in range(N):
a,b=map(int,input().split())
L.append(a)
if a in D:D[a]=D[a]+b
else:D[a]=b
l=list(set(L)).sort()
for i in l:
K-=D[i]
if K<=0:
print(i)
exit() |
s176828332 | p03721 | u695429668 | 1560996627 | Python | Python (3.4.3) | py | Runtime Error | 455 | 16992 | 348 | 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 = a.sort()
for i in range(N):
buff += [a[i][0]] * a[i][1]
# buff = so... |
s824322103 | p03721 | u695429668 | 1560911490 | Python | Python (3.4.3) | py | Runtime Error | 362 | 5936 | 292 | N, K = list(map(int, input().split()))
__max = 10**5+1
buff = [0 for i in range(__max)]
a = []
ans = 0
b = 0
for i in range(N):
_a, _b = list(map(int, input().split()))
buff[_a] = _b
for i in range(1,__max+1):
if K <= buff[i]:
print(i)
exit()
K -= buff[i]
|
s957048713 | p03721 | u695429668 | 1560911256 | Python | PyPy3 (2.4.0) | py | Runtime Error | 580 | 45232 | 291 | N, K = list(map(int, input().split()))
__max = 10**5+1
buff = [0 for i in range(__max)]
a = []
ans = 0
b = 0
for i in range(N):
_a, _b = list(map(int, input().split()))
buff[_a] = _b
for i in range(1,__max+1):
if K <= buff[i]:
print(i)
exit()
K -= buff[i] |
s579610853 | p03721 | u498620941 | 1560093460 | Python | Python (3.4.3) | py | Runtime Error | 420 | 21560 | 473 |
def list_pos(cnt,a,b,ans):
if ans >= b :
return cnt-1
else :
ans += a[cnt][1]
cnt += 1
return list_pos(cnt,a,b,ans)
import sys
sys.setrecursionlimit(10000)
N,K = map(int,input().split())
para = {}
for i in range(N):
a,b = map(int,input().split())
if not a in para.keys... |
s513038345 | p03721 | u498620941 | 1560093373 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 471 | import sys
sys.setrecursionlimit(10000)
def list_pos(cnt,a,b,ans):
if ans >= b :
return cnt-1
else :
ans += a[cnt][1]
cnt += 1
return list_pos(cnt,a,b,ans)
N,K = map(int,input().split())
para = {}
for i in range(N):
a,b = map(int,input().split())
if not a in para.keys():
... |
s318887976 | p03721 | u498620941 | 1560093188 | Python | Python (3.4.3) | py | Runtime Error | 417 | 15036 | 433 | def list_pos(cnt,a,b,ans):
if ans >= b :
return cnt-1
else :
ans += a[cnt][1]
cnt += 1
return list_pos(cnt,a,b,ans)
N,K = map(int,input().split())
para = {}
for i in range(N):
a,b = map(int,input().split())
if not a in para.keys():
para[a] = b
else : para[... |
s285662057 | p03721 | u498620941 | 1560093041 | Python | Python (3.4.3) | py | Runtime Error | 419 | 15036 | 428 | def list_pos(cnt,a,b,ans):
if ans >= b :
return cnt-1
else :
ans += a[cnt][1]
cnt += 1
return list_pos(cnt,a,b,ans)
N,K = map(int,input().split())
para = {}
for i in range(N):
a,b = map(int,input().split())
if not a in para.keys():
para[a] = b
else : para[a] +... |
s873514610 | p03721 | u498620941 | 1560092202 | Python | Python (3.4.3) | py | Runtime Error | 393 | 22140 | 309 | def list_pos(cnt,a,b,ans):
if ans >= b :
return cnt-1
else :
ans += a[cnt][1]
cnt += 1
return list_pos(cnt,a,b,ans)
N,K = map(int,input().split())
para = [[i for i in map(int,input().split())] for j in range(N)]
p = list_pos(0,para,K,0)
print("{}".format(para[p][0]))
|
s447464319 | p03721 | u498620941 | 1560091769 | Python | Python (3.4.3) | py | Runtime Error | 388 | 22140 | 306 | def list_pos(cnt,a,b,ans):
if ans >= b :
return cnt
else :
cnt += 1
ans += a[cnt][1]
return list_pos(cnt,a,b,ans)
N,K = map(int,input().split())
para = [[i for i in map(int,input().split())] for j in range(N)]
p = list_pos(-1,para,K,0)
print("{}".format(para[p][0])) |
s854602717 | p03721 | u498620941 | 1560091560 | Python | Python (3.4.3) | py | Runtime Error | 395 | 22136 | 307 | def list_pos(cnt,a,b,ans):
if ans >= b :
return cnt-1
else :
cnt += 1
ans += a[cnt][1]
return list_pos(cnt,a,b,ans)
N,K = map(int,input().split())
para = [[i for i in map(int,input().split())] for j in range(N)]
p = list_pos(0,para,K,0)
print("{}".format(para[p][0])) |
s994051015 | p03721 | u498620941 | 1560090314 | Python | Python (3.4.3) | py | Runtime Error | 370 | 22832 | 249 | N,K = map(int,input().split())
para = [[i for i in map(int,input().split())] for j in range(N)]
ans= []
size = 0
for i in range(N) :
if size > K :
break
else:
ans += para[i]
size = len(ans)
print("{}".format(ans[K])) |
s895033773 | p03721 | u498620941 | 1560090209 | Python | Python (3.4.3) | py | Runtime Error | 354 | 22860 | 246 | N,K = map(int,input().split())
para = [[i for i in map(int,input().split())] for j in range(N)]
ans= []
size = 0
for i in range(N) :
if N > K :
break
else:
ans += para[i]
size = len(ans)
print("{}".format(ans[K])) |
s063232415 | p03721 | u055941944 | 1559269235 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 171 | n,k=map(int,input().split())
a=[list(map(int,input().split()) for _ in range(n)]
a.sort
new=0
for i in a:
now+=i[1]
if now>=k:
print(i[0])
break
|
s945695946 | p03721 | u854117336 | 1559157985 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 2 | go |
s496727587 | p03721 | u399721252 | 1559148489 | Python | Python (3.4.3) | py | Runtime Error | 452 | 21948 | 356 |
import bisect
n, k = [ int(v) for v in input().split() ]
num_list = sorted([ tuple(map(int, input().split())) for i in range(n) ])
order_list, value_list = [ 0 for i in range(n) ], [ 0 for i in range(n) ]
for i in range(n):
order_list[i] = num_list[i][1] + order_list[i-1]
value_list[i] = num_list[i][0]
print(valu... |
s800062621 | p03721 | u047393579 | 1558531618 | Python | Python (3.4.3) | py | Runtime Error | 2106 | 1702812 | 432 | N, K = map(int, input().split())
lis = [10**5]*K
for _ in range(N):
a, b = map(int, input().split())
if a < lis[K-1]:
for index, num in enumerate(lis):
if num > a:
if index + b < K:
lis = lis[:index] + [a for _ in range(b)] + lis[index:K-b]
... |
s445670391 | p03721 | u811000506 | 1558230338 | Python | Python (3.4.3) | py | Runtime Error | 271 | 3060 | 153 | N, K = map(int,input().split())
count = 0
while True:
a,b = map(int,input().split())
count += b
if count > K:
print(a)
exit() |
s565092574 | p03721 | u391731808 | 1557532603 | Python | Python (3.4.3) | py | Runtime Error | 310 | 49676 | 157 | N,K = map(int,input().split())
ab = sorted([map(int,input().split()) for _ in [0]*N])
for a,b in ab:
K -= b
if K <= 0:
print(a)
break |
s098047120 | p03721 | u637515289 | 1556995316 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 189 | import sys
def main():
n, k = map(int, input().split())
num = 0
for i in range(n):
a, b = map(int, input().split())
num += b
if (num >= k):
print(a)
sys.exit()
|
s697938840 | p03721 | u337851472 | 1554928032 | Python | Python (3.4.3) | py | Runtime Error | 1995 | 985996 | 133 | N, K = map(int,input().split())
ans = ""
for i in range(N):
a, b = map(int,input().split())
ans += str(a)*b
print(ans[K-1])
|
s031433737 | p03721 | u426108351 | 1554317275 | Python | Python (3.4.3) | py | Runtime Error | 329 | 5900 | 241 | N, K = map(int, input().split())
number = [0 for i in range(N+1)]
for i in range(N):
a, b = map(int, input().split())
number[a] += b
for i in range(N):
if K - number[i+1] <= 0:
print(i+1)
break
else:
K -= number[i+1]
|
s100013528 | p03721 | u426108351 | 1554317206 | Python | Python (3.4.3) | py | Runtime Error | 350 | 6288 | 231 | N, K = map(int, input().split())
number = [0 for i in range(N+1)]
for i in range(N):
a, b = map(int, input().split())
number[a] += b
for i in range(N):
if K - number[i+1] <= 0:
print(i+1)
else:
K -= number[i+1]
|
s181335157 | p03721 | u652081898 | 1553141176 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 181 | n k = map(int, input().split())
ab = [[map(int, input().split())] for _ in range(n)]
count = 0
for x in ab:
count += x[1]
if k <= count:
print(x[0])
break
|
s194374105 | p03721 | u518064858 | 1552956594 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 207 | n,k=map(int,input().split())
list=[0]*11
for i in range(n):
a,b=map(int,input().split())
list[a]+=b
sum=0
for l in range(1,len(list)):
sum+=list[l]
if sum>=k:
print(l)
exit()
|
s025184586 | p03721 | u518064858 | 1552952849 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3828 | 206 | n,k=map(int,input().split())
list=[0]*10**5+1
for i in range(n):
a,b=map(int,input().split())
list[a]+=b
sum=0
for i in range(1,n+1):
sum+=list[i]
if sum>=k:
print(i)
exit()
|
s746626340 | p03721 | u887207211 | 1552772658 | Python | Python (3.4.3) | py | Runtime Error | 333 | 27352 | 183 | N, K = map(int,input().split())
AB = sorted([[list(map(int,input().split())) for _ in range(N)]])
tmp = 0
for a, b in AB:
if(tmp < K-b):
tmp += b
else:
print(a)
break |
s136781232 | p03721 | u393512980 | 1552362121 | Python | Python (3.4.3) | py | Runtime Error | 344 | 10856 | 306 | from collections import defaultdict
n, k = map(int, input().split())
dic = defaultdict(int)
for _ in range(n):
a, b = map(int, input().split())
dic[a] += b
dic = sorted(dic, key = lambda x: x[0])
cnt = 0
for key in dic:
if cnt + dic[key] < k:
cnt += dic[key]
else:
print(key)
break
|
s564332784 | p03721 | u887207211 | 1550901500 | Python | Python (3.4.3) | py | Runtime Error | 331 | 27352 | 184 | N, K = 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 |
s303882344 | p03721 | u887207211 | 1550901473 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 184 | N, K = 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
|
s858994797 | p03721 | u026155812 | 1550267242 | Python | Python (3.4.3) | py | Runtime Error | 2237 | 734140 | 279 | N, K = [int(i) for i in input().split()]
a = [0]*N
b = [0]*N
for i in range(N):
a[i], b[i] = [int(i) for i in input().split()]
c = 0
d = 0
for i in b:
c += i
if c >= K:
break
d += 1
A = []
for i in range(d):
A += [a[i]]*b[i]
A.sort()
print(A[K]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.