KefaandCompany.cpp

/* 
AUTHOR: Antarikshya Mitra
TIME: 
PROBLEM NO:- Kefa and Company Div2 B
*/


#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define endl '\n'
const int MOD = 1e9 + 7; 

bool cmp(const vector<int> &a,const vector<int> &b)
{
	if(a[0]<b[0]) return true;
	else return false;
}



void solve(vector<vector<int>> &arr,int d)
{
	int n = arr.size();
	sort(arr.begin(),arr.end(),cmp);
	int l = 0;
	int sum = 0;
	int ans = 0;
	for(int r=0;r<n;r++)
	{
		sum+=arr[r][1];
		while(l<r && arr[r][0] - arr[l][0] >= d)
		{
			sum-=arr[l][1];
			l++;
		}
		ans = max(ans,sum);
	}
	cout<<ans<<endl;
	return;
}

int32_t main()
{
	ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
		int n,d;
		cin>>n>>d;
		vector<vector<int>> arr(n);
		for(int i=0;i<n;i++)
		{
			int money,points;
			cin>>money>>points;
			arr[i] = {money, points};
		}
		solve(arr,d);	
	return 0;
}