#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

const int MAX = 1000000000;
const long long INF = LLONG_MAX / 4;

int solve1(const vector<int>& t, const vector<long long>& d, int k)
{
    int n = t.size();
    int left = 0;
    int right = MAX;
    while(left < right){
        int mid = (left + right) / 2;
        int prev = -MAX;
        bool ok = true;
        for(int i=0; i<n; ++i){
            if(d[i] > mid){
                if(t[i] - prev < k)
                    ok = false;
                prev = t[i];
            }
        }
        if(ok)
            right = mid;
        else
            left = mid + 1;
    }
    return left;
}

long long solve2(const vector<int>& t, const vector<long long>& d, int k, int x)
{
    int n = t.size();
    int i = 0;
    int j = 0;
    long long maxVal = 0;
    vector<long long> dp(n+1, -INF);
    dp[0] = 0;

    for(int i=0; i<n; ++i){
        while(t[j] + k <= t[i]){
            ++ j;
            maxVal = max(maxVal, dp[j]);
        }
        if(d[i] <= x){
            if(j == 0 || t[j-1] + k <= t[i])
                dp[i+1] = maxVal + d[i];
        }
        else{
            dp[i+1] = maxVal + d[i];
            j = i;
            maxVal = -INF;
        }
    }
    return accumulate(d.begin(), d.end(), 0LL) - *max_element(dp.begin(), dp.end());
}

int main()
{
    int n, k;
    cin >> n >> k;
    vector<int> t(n);
    vector<long long> d(n);
    for(int i=0; i<n; ++i)
        cin >> t[i] >> d[i];

    int x = solve1(t, d, k);
    cout << x << endl << solve2(t, d, k, x) << endl;

    return 0;
}