Codeforces--580B--Kefa and Company

题目描述：
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!
输入描述:
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.
输出描述:
Print the maximum total friendship factir that can be reached.
输入：
4 5
75 5
0 100
150 20
75 1
5 100
0 7
11 32
99 10
46 8
87 54
输出：
100
111
题意：
Kefa这个人要去吃饭，他要邀请一些朋友一起去，他的每个朋友有两个属性金钱和关系度，要求邀请的人里边任意两个人之间的金钱差的绝对值不大于d；求被邀请的所有朋友的关系度的和的最大值。
题解：
尺取法，求个前缀和，直接搞
代码：

#include<cstdio>
#include<cstring>
#include