# https://yukicoder.me/problems/no/448

from bisect import bisect_left

N, K = map(int, input().split())
queries = []
for _ in range(N):
    queries.append(tuple(map(int, input().split())))


def isOK(x):
    wake = None
    for t, d in queries:
        if d > x:
            if (wake is not None) and t - wake < K:
                return False
            wake = t
    return True


# 難しさの最大値の最小化
def calc_min_diff():
    l, r = -1, 10 ** 9 + 5
    while (r - l) > 1:
        m = (r + l) // 2
        if isOK(m):
            r = m
        else:
            l = m
    return r


# 難しさの総和の最小化
def calc_min_sum(max_diff: int):
    INF = 10 ** 9

    acc = [0] * (N + 1)
    for i, (_, d) in enumerate(queries):
        acc[i + 1] = acc[i] + (d if d <= max_diff else INF)  # ame連続でやる．不可能ならINF

    dp = [0] * (N + 1)
    yuki_idx = 0
    for i, (t, d) in enumerate(queries):
        while queries[yuki_idx][0] < t - K + 1:
            yuki_idx += 1
        dp[i + 1] = min(
            dp[i] + (d if d <= max_diff else INF),  # ameがやる
            dp[yuki_idx] + acc[i] - acc[yuki_idx]  # yukiがやる
        )
        # print(i, yuki_idx, dp[i + 1])
    return dp[-1]


max_diff = calc_min_diff()
print(max_diff)
total_diff = calc_min_sum(max_diff)
print(total_diff)