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
4 5 75 5 0 100 150 20 75 1
100
5 100 0 7 11 32 99 10 46 8 87 54
111
Hint
In the first sample test the most profitable strategy is to form a company from only the second friend. At all other variants the total degree of friendship will be worse.
In the second sample test we can take all the friends.
题意:邀请朋友去吃饭,每个朋友有mi的钱,和si的友情值,要求朋友间的钱相差不能多于d,求能得到的最大友情值
思路:有点类似于动态规划,先将钱数从小到大排序,然后不断的更新最优解
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
__int64 money;
__int64 num;
}t[110000];
bool cmp(node a,node b)
{
if(a.money!=b.money)
return a.money<b.money;
return a.num<b.num;
}
__int64 n,d,i,j,k,l,MAX,sum[110000];
int main()
{
while(scanf("%I64d%I64d",&n,&d)!=EOF)
{
for(i=0;i<n;i++)
scanf("%I64d%I64d",&t[i].money,&t[i].num);
sort(t,t+n,cmp);
__int64 sum=0;
i=0;
j=0;
MAX=0;
while(i<n)
{
if(abs(t[j].money-t[i].money)<d)
{
sum+=t[i].num;
i++;
}
else
{
sum-=t[j].num;
j++;
}
MAX=max(MAX,sum);//更新最优解
}
printf("%I64d\n",MAX);
}
return 0;
}