#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n,k;
pii qs[252521];
ll psum[252521];
int cnt[252521];
ll dp[252521];

int main(){
  scanf("%d%d",&n,&k);
  REP(i,n){
    int t,d;
    scanf("%d%d",&t,&d);
    qs[i] = pii(t,d);
  }
  // calc max difficulty
  int low = -1, high = 1000000025;
  while(low+1 < high){
    int mid = (low+high)/2;
    int last = -k;
    bool flag = true;
    REP(i,n){
      if(qs[i].second > mid){
        // wake
        if(qs[i].first - last >= k){
          // ok
          last = qs[i].first;
        }else{
          // ng
          flag = false;
          break;
        }
      }
    }
    if(flag){
      high = mid;
    }else{
      low = mid;
    }
  }
  int mxd = high;
  REP(i,n)psum[i+1] = psum[i]+qs[i].second;
  REP(i,n)cnt[i+1] = cnt[i]+(int)(qs[i].second > mxd);
  REP(i,n+1)dp[i] = (ll)1e18;
  dp[0] = 0;
  int plusk = 0;
  REP(i,n){
    int now = qs[i].first;
    int dif = qs[i].second;
    // use
    if(dif <= mxd)CHMIN(dp[i+1],dp[i]+dif);
    // skip this
    while(plusk < n && qs[plusk].first < now+k)plusk++;
    if(cnt[plusk]-cnt[i+1]==0)CHMIN(dp[plusk],dp[i]+psum[plusk]-psum[i+1]);
  }
  printf("%d\n%lld\n",mxd,dp[n]);
  return 0;
}