#include <cstdio>
#include <cmath>

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define inc( i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec( i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

typedef long long   signed int LL;
typedef long long unsigned int LU;

template<typename T> void swap(T &x, T &y) { T t = x; x = y; y = t; return; }
template<typename T> T abs(T x) { return (0 <= x ? x : -x); }
template<typename T> T max(T a, T b) { return (b <= a ? a : b); }
template<typename T> T min(T a, T b) { return (a <= b ? a : b); }
template<typename T> bool setmin(T &a, T b) { if(a <= b) { return false; } else { a = b; return true; } }
template<typename T> bool setmax(T &a, T b) { if(b <= a) { return false; } else { a = b; return true; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int n, k, t[200001], d[200000];
LL dp[200000];
bool flag[200000];

int main() {
	scanf("%d%d", &n, &k);
	inc(i, n) { scanf("%d%d", &t[i], &d[i]); }
	
	int a = -1, b = 1000000000, c;
	while(a + 1 < b) {
		c = (a + b) / 2;
		int call = -1;
		bool flag = true;
		inc(i, n) {
			if(d[i] > c && call != -1 && t[i] - t[call] < k) { flag = false; break; }
			if(d[i] > c) { call = i; }
		}
		(flag ? b : a) = c;
	}
	
	int last = n;
	t[last] = 2000000001;
	dec(i, n) {
		flag[i] = (t[last] - t[i] >= k);
		if(d[i] > b) { last = i; }
	}
	
	int call = -1;
	inc(i, n) {
		while(t[i] - t[call + 1] >= k) { call++; }
		dp[i] = max(i == 0 ? 0 : dp[i - 1], (call != -1 ? dp[call] : 0) + (flag[i] ? d[i] : 0));
	}
	
	LL sum = 0;
	inc(i, n) { sum += d[i]; }
	
	printf("%d\n%lld\n", b, sum - dp[n - 1]);
	
	return 0;
}