N,K = map(int,input().split())
H,W = [],[]
ty_H,ty_W = '',''
for i in range(N):
    ty_H,ty_W = map(int,input().split())
    H.append(ty_H),W.append(ty_W)

h,w,h_n,w_n,sum = 0,0,0,0,0
for j in range(min(H+W),0,-1):
    sum = 0
    for i in range(N):
        h_n,w_n = 0,0
        h,w = H[i],W[i]
        while h >= j:
            h_n += 1
            h = h-j 
        while w >= j:
            w_n += 1
            w = w-j
        sum += h_n*w_n
    if sum >= K:
        break

print(j)

示例没问题，但除第二个检查点都是WA，最后两个超时TLE