import sys
input = sys.stdin.readline

def judge(x):
    T = [-10**18]+[Ti for Ti, Di in TD if Di>=D[x]]
    
    for i in range(len(T)-1):
        if T[i+1]-T[i]<K:
            return False
    
    return True

def binary_search():
    left, right = 0, len(D)-1
    
    while left<=right:
        mid = (left+right)//2
        
        if judge(mid):
            left = mid+1
        else:
            right = mid-1
    
    return right
            
N, K = map(int, input().split())
TD = [tuple(map(int, input().split())) for _ in range(N)]
D = list(set([Di for _, Di in TD]))
D.sort(reverse=True)
idx = binary_search()

if idx==len(D)-1:
    print(0)
else:
    print(D[idx+1])
    
dp = [[10**18]*(N+1) for _ in range(N+1)]
dp[0][0] = 0

for i in range(N):
    Ti, Di = TD[i]
    
    for j in range(i+1):
        if j==0:
            dp[i+1][i+1] = min(dp[i+1][i+1], dp[i][j])
        elif Ti-TD[j-1][0]>=K:
            dp[i+1][i+1] = min(dp[i+1][i+1], dp[i][j])
        
        if Di<D[idx]:
            dp[i+1][j] = min(dp[i+1][j], dp[i][j]+Di)

print(min(dp[N]))