Codeforces Round #321 (Div. 2) B 二分+预处理
2016-07-13 23:52
309 查看
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.
Examples
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.
题意:n个朋友 每个朋友拥有mon钱数 fri 友谊值
现在邀请若干朋友参加聚会 要求朋友间的钱数差小于d
输出被邀请参加聚会的 朋友的 友谊值的总和的最大值
题解:sort一下 记录前缀和 转换为取连续区间的和的最大值
固定左边界 按照 题目对钱数差距的要求 二分右边界 最后取区间和的max
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.
Examples
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
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.
题意:n个朋友 每个朋友拥有mon钱数 fri 友谊值
现在邀请若干朋友参加聚会 要求朋友间的钱数差小于d
输出被邀请参加聚会的 朋友的 友谊值的总和的最大值
题解:sort一下 记录前缀和 转换为取连续区间的和的最大值
固定左边界 按照 题目对钱数差距的要求 二分右边界 最后取区间和的max
#include<iostream> #include<cstring> #include<cstdio> #include<algorithm> #define ll __int64 using namespace std; ll n,d; ll sum[100005]; struct node { ll mon; ll fri; }N[100005]; bool cmp(struct node aa,struct node bb) { if(aa.mon<bb.mon) return true; return false; } int main() { scanf("%I64d %I64d",&n,&d); for(int i=1;i<=n;i++) scanf("%I64d %I64d",&N[i].mon,&N[i].fri); sort(N+1,N+1+n,cmp); sum[0]=0; ll ans=0; for(int i=1;i<=n;i++) sum[i]=sum[i-1]+N[i].fri; for(int i=1;i<=n;i++) { ll l=i,r=n,mid; while(l<r) { mid=(l+r+1)>>1; if((N[mid].mon-N[i].mon)>=d) r=mid-1; else l=mid; } //cout<<i<<" "<<l<<" "<<mid<<" "<<r<<"&&&"<<endl; ans=max(ans,sum[l]-sum[i-1]); } cout<<ans<<endl; return 0; }
相关文章推荐
- 关于电脑屏幕分辨率太高字太小怎么解决?
- 自动查找函数地址的程序
- java捕获线程异常
- 装theano,配置GPU
- javascript基础:表单处理3
- 设计模式 — UML常见符号
- 从汇编代码提取Shellcode的简单实现
- Java-----Cglib之BeanCopier实现Bean的拷贝
- Windows下快速搭建安卓开发环境android-studio
- MYSQL数据库管理之权限管理
- 7月11日实习报告
- 李洪强iOS开发之OC常见错误汇总
- opencv4android--RGB2HSV
- [javascript权威指南][阅读笔记]三
- jQuery给动态生成的元素添加事件
- Path类与Directory类与File类
- 腾讯2017暑期实习生编程题
- cannot merge new index 65555 into a non-jumbo instruction!
- 简单shellcode
- 几个小例子--memory leak