#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define all(v) ALL(v)
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
#define CININIT cin.tie(0),ios::sync_with_stdio(false)
struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }

constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

ll N,K;
set<ll> must;
vector<ll> dp;

bool exist(ll T){
    auto id = must.upper_bound(T-K);
    if(id==must.end()) return false;

    ll ft = *id;
    if(abs(ft-T)<K) return true;
    else return false;
}

int main(){
    cin>>N>>K;
    dp.assign(N+10,0);
    ll sum=0;
    vector<ll> T(N),D(N);
    vector<pair<ll,ll>> vp; // (cost,time)
    map<ll,int> t2i;        // time->index
    rep(i,N){
        ll a,b;
        cin>>a>>b;
        vp.push_back(MP(b,a));
        sum+=b;
        T[i]=a;
        D[i]=b;
    }
    //debug(sum);
    sort(all(vp));
    reverse(all(vp));
    for(int i=0;i<N;i++) t2i[T[i]]=i;

    vector<bool> u(N+10,true);
    set<ll> st;

    for(int i=0;i<N;i++){
        ll t=vp[i].second,c=vp[i].first;
        auto it = st.upper_bound(t-K);
        if(it==st.end() or abs(*it-t)>=K){
            u[i] = false;
            st.insert(t);
        }
    }
    ll mxv=0;
    for(int i=0;i<N;i++) if(u[i]){
        mxv = max(mxv,vp[i].first);
    }
    cout << mxv << endl;

    for(int i=0;i<N;i++){
        if(D[i]>mxv) must.insert(T[i]);
    }

    vector<ll> T2,D2;
    for(int i=0;i<N;i++){
        if(D[i]<=mxv){
            T2.push_back(T[i]);
            D2.push_back(D[i]);
        }
    }

    debug(T2);
    debug(D2);

    for(int i=0;i<T2.size();i++){
        ll t=T2[i];
        ll d=D2[i];
        //cerr << "loop " << i << " d=" << d << " " ;
        if(exist(t)){       // t-K ~ t+Kに使用決定しているものがある場合
            //cerr << "exist" << endl;
            dp[i+1] = dp[i];
        }else{              // t-K ~ t+Kに使用決定しているものが無い場合
            int id = upper_bound(all(T2),t-K) - T2.begin();
            if(id < 0){
                //cerr << "id-1<0" << endl;
                dp[i+1] = d;
            }else{
                //cerr << "else id=" << id << "  -> max(" << dp[i] << " , " << dp[id]+d <<")" << endl;
                dp[i+1] = max(dp[i],dp[id]+d);
            }
        }
    }

    //cerr << "----------" << endl;
    //for(int i=0;i<T2.size();i++) cerr << dp[i] << endl;
    //cerr << "----------" << endl;

    ll maxsum=0;
    for(int i=0;i<N;i++) if(D[i]>mxv) maxsum += D[i];
    int n=T2.size();
    cout << sum - (dp[n]+maxsum) << endl;
}