n,k = map(int,input().split())
t = [0]*n
d = [0]*n
for i in range(n):
    t[i],d[i] = map(int,input().split())

def check(x): #x以上を全部任せるが可能か？
    v = -1<<32
    for i in range(n):
        if d[i] >= x:
            if t[i]-v < k: return False
            else: v = t[i]
    return True

ok = 10**9+1
ng = 0
while ok-ng > 1:
    mid = (ok+ng)//2
    if check(mid): ok = mid
    else: ng = mid


acc = [0]*(n+1)
INF = 1<<40
for i in range(n):
    if d[i] >= ok: d[i] = INF
    acc[i+1] += acc[i]+d[i]

from bisect import bisect_left
dp2 = [0]*n #dp[i] = i 日目までの仕事の最小値
for i in range(n):
    ti,di = t[i],d[i]
    idx = bisect_left(t,ti-k+1)
    x = (dp2[idx-1] if idx else 0) + acc[i] - acc[idx] #休むとき
    dp2[i] = min(dp2[i-1]+di,x)

print(ok-1)
print(dp2[-1])