B. Kefa and Company双指针

Posted 2022-03-26 辉小歌

https://codeforces.com/problemset/problem/580/B

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> PII;
const int N=1e5+10;
vector<PII>ve;
int n,d,s[N];
int main(void)

	cin>>n>>d;
	for(int i=0;i<n;i++)
	
		int a,b; cin>>a>>b;
		ve.push_back(a,b);
	
	sort(ve.begin(),ve.end());
	long long int ans=0,s=0;
	for(int i=0,j=0;i<ve.size();i++)
	
		s+=ve[i].second;
		while(ve[i].first-ve[j].first>=d) s-=ve[j].second,j++;
		ans=max(ans,s);
	
	cout<<ans;
	return 0;