CodeForces580B

Kefa and Company
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit

Status

Practice

CodeForces 580B
Description
Kefa wants to celebrate his first big salary by going to restaurant. However, he needs company.

Kefa has n friends, each friend will agree to go to the restaurant if Kefa asks. Each friend is characterized by the amount of money he has and the friendship factor in respect to Kefa. The parrot doesn’t want any friend to feel poor compared to somebody else in the company (Kefa doesn’t count). A friend feels poor if in the company there is someone who has at least d units of money more than he does. Also, Kefa wants the total friendship factor of the members of the company to be maximum. Help him invite an optimal company!

Input
The first line of the input contains two space-separated integers, n and d (1 ≤ n ≤ 105, ) — the number of Kefa’s friends and the minimum difference between the amount of money in order to feel poor, respectively.

Next n lines contain the descriptions of Kefa’s friends, the (i + 1)-th line contains the description of the i-th friend of type mi, si (0 ≤ mi, si ≤ 109) — the amount of money and the friendship factor, respectively.

Output
Print the maximum total friendship factir that can be reached.

Sample Input
Input
4 5
75 5
0 100
150 20
75 1
Output
100
Input
5 100
0 7
11 32
99 10
46 8
87 54
Output
111
水题，排个序然后用两个指针一左一右扫一遍o（n）就搞定了，注意结果用longlong保存，被坑了好几发。也可以用dp做。

#include "cstring"
#include "cstdio"
#include "string.h"
#include "iostream"
#include "algorithm"
using namespace std;
typedef struct node
{
    int m;
    int f;
}node;
node list[100002];
bool cmp(node a,node b)
{
    return a.m<b.m;
}
int main()
{
    int n,d;
    while(~scanf("%d%d",&n,&d))
    {
        for(int i=0;i<n;i++)
            scanf("%d%d",&list[i].m,&list[i].f);
        sort(list,list+n,cmp);
        int l,r;
        l=r=0;
        long long ans=0;
        long long max=0;
        while(r!=n)
        {
            if(list[r].m-list[l].m<d)
            {
                ans+=list[r].f;
                if(max<ans)
                    max=ans;
                r++;
                continue;
            }
            if(list[r].m-list[l].m>=d)
            {
                ans-=list[l].f;
                l++;
                continue;
            }

        }
        printf("%lld\n",max);
    }
}