/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.06.04 13:02:39
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int n, k;
// x以下のものを自分でするときにできるか
bool f(int x, const vector< pair< int, int > >& a) {
    int pre = -1000000000;
    for (int i = 0; i < n; i++) {
        if (x < a[i].second) {
            if (a[i].first - pre >= k) {
                pre = a[i].first;
            } else {
                return false;
            }
        }
    }
    return true;
}
int main() {
    cin >> n >> k;
    vector< pair< int, int > > a(n);
    ll sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i].first >> a[i].second;
        sum += a[i].second;
    }
    int l = -1, r = 1000000000;
    while (r - l > 1) {
        int mid = l + (r - l) / 2;
        if (f(mid, a)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    cout << r << endl;
    vector< bool > aaa(n, false);
    ll prev = 1000000000000000;
    for (int i = n - 1; i >= 0; i--) {
        if (prev - a[i].first < k) {
            aaa[i] = true;
        } else if (a[i].second > r) {
            prev = a[i].first;
        }
    }
    constexpr long long LLINF = 1e18 + 1;
    vector< ll > dp(n, 0);
    dp[n - 1] = a[n - 1].second;
    for (int i = n - 2; i >= 0; i--) {
        // 飛ばす
        if (!aaa[i]) {
            auto p = lower_bound(a.begin(), a.end(), make_pair(a[i].first + k, -1));
            if (p != a.end()) {
                dp[i] = max(dp[i], dp[p - a.begin()] + a[i].second);
            } else {
                dp[i] = a[i].second;
            }
        }
        if (r >= a[i].second) {
            dp[i] = max(dp[i], dp[i + 1]);
        }
    }
    cout << sum - dp[0] << endl;
    return 0;
}