#include<bits/stdc++.h>
using namespace std;

#define int long long
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define fi first
#define se second
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}

int K;

bool C(int th,vpint &v){
    int pre=-1001001001;
    rep(i,v.size()){
        if(v[i].se<=th)continue;
        if(v[i].fi-pre<K)return false;
        pre=v[i].fi;
    }
    return true;
}

int dp[222222];
int solve(vpint &u){
    if(u.size()==0)return 0;
    int cur=0;
    int ma=0;
    rep(i,u.size()){
        while(cur<i&&u[i].fi-u[cur].fi>=K)chmax(ma,dp[cur++]);
        dp[i]=ma+u[i].se;
    }
    ma=*max_element(dp,dp+u.size());
    int ret=0;rep(i,u.size())ret+=u[i].se;
    return ret-ma;
}

signed main(){
    int N;
    cin>>N>>K;
    vpint v;
    rep(i,N){
        int t,d;
        cin>>t>>d;
        v.pb({t,d});
    }
    int lb=-1,ub=1001001001;
    while(ub-lb>1){
        int mid=(ub+lb)/2;
        if(C(mid,v))ub=mid;
        else lb=mid;
    }

    bool flag[222222]={};
    int pre=-1001001001;
    rep(i,N){
        if(v[i].se>ub)pre=v[i].fi;
        else{
            if(v[i].fi-pre<K)flag[i]=true;
        }
    }
    pre=INT_MAX;
    for(int i=N-1;i>=0;i--){
        if(v[i].se>ub)pre=v[i].fi;
        else{
            if(pre-v[i].fi<K)flag[i]=true;
        }
    }

    int ans=0;
    vpint u;
    rep(i,N){
        if(flag[i])ans+=v[i].se;
        else if(v[i].se<=ub)u.pb(v[i]);
    }

    ans+=solve(u);
    cout<<ub<<endl;
    cout<<ans<<endl;
    return 0;
}