cf 580B
2015-09-23 13:32
169 查看
B. Kefa and Company
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
input
output
input
output
Note
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.
//求出每个数开始到d内的值
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
input
4 5 75 5 0 100 150 20 75 1
output
100
input
5 1000 7
11 32
99 10
46 8
87 54
output
111
Note
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.
//求出每个数开始到d内的值
#include <iostream> #include <stdio.h> #include <string.h> #include <cmath> #include <algorithm> #include <map> #include <queue> using namespace std; const int maxn=100000+10; const int inf=(1<<30); struct Node { __int64 num,val; }p[maxn]; bool cmp(Node a,Node b) { return a.num<b.num; } __int64 ans[maxn]; int main() { int n,d; while(~scanf("%d%d",&n,&d)) { for(int i=0;i<n;i++) { scanf("%I64d%I64d",&p[i].num,&p[i].val); } memset(ans,0,sizeof(ans)); sort(p,p+n,cmp); __int64 cnt=0; for(int i=0;i<n;i++) { if(abs(p[i].num-p[cnt].num)<d) ans[cnt]+=p[i].val; else { cnt++; ans[cnt]=ans[cnt-1]-p[cnt-1].val; i--; } } sort(ans,ans+cnt+1); printf("%I64d\n",ans[cnt]); } return 0; }
相关文章推荐
- Git的使用和相关配置
- 数据入库总结
- leetcode - Missing Ranges
- 著名的英文搜索引擎
- 程序员迷茫的感情生活
- 登录时旋转等待效果
- 重载和多态之间的关系?!(C++初学者)
- MySQL DBA 面试全揭秘
- python3 入门 (二) 列表的使用
- 软件重构
- 跟马哥学linux (lesson 8)awk & sed功能总结
- no lable views point to this text field with an android:lablFor=”@+id/@+id
- HDU 1054 Strategic Game(简单树形DP)
- java文件切割工具
- 数独游戏设计与实现之第二篇——开发环境
- 导航栏控制器
- javascript调用EXE程序传值
- android gradle command
- IE版本的语句和placeholder——疑问1
- cf 580 A