B. Kefa and Company
来源:互联网 发布:无线淘宝 编辑:程序博客网 时间:2024/04/29 04:39
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 575 50 100150 2075 1
100
5 1000 711 3299 1046 887 54
111
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.
解题说明:此题是求某个区间范围内的数,并让该数对应的值和最大。可以采用先排序,然后遍历的做法,在遍历过程中统计出每个区间中的最大值,最后得到一个全局的最大值。
#include<stdio.h>#include <string.h>#include<iostream>#include<algorithm>using namespace std;int n,m,a,b,x,d;int main(){ cin>>n>>d; pair<int,int>p[100005]; for(int i=0;i<n;++i){cin>>p[i].first>>p[i].second;}sort(p,p+n); long long ans=0,cur=0,st=0; for(int i=0;i<n;) { if(p[i].first-p[st].first>=d){cur-=p[st].second;++st;} else{ cur+=p[i].second; ++i; } ans=max(ans,cur); } cout<<ans<<endl;return 0;}
- B. Kefa and Company
- cf:B Kefa and Company
- codeforce B Kefa and Company
- B. Kefa and company(#321 div2)
- Codeforces Round #321 B Kefa and Company
- CF#321-B - Kefa and Company-贪心-
- coderforce 580B Kefa and Company
- codeforces-580B Kefa and Company(二分)
- CodeForces 580B Kefa and Company
- Codeforces 580B Kefa and Company
- 【CodeForces】[580B]Kefa and Company
- CodeForces 580B Kefa and Company
- CodeForces 580B Kefa and Company
- 【CodeForces 580B】Kefa and Company
- codeforces 580B Kefa and Company
- Kefa and Company
- Kefa and Company
- L - Kefa and Company
- 单利模式的优缺点和使用场景
- kindeditor编辑器空格键删除解决方法
- Create class at OC runtime
- 关于onPostCreate——Activity彻底运行起来之后的回调
- ORA-01843: not a valid month 错误
- B. Kefa and Company
- 杭电acm4510
- noip2011 选择客栈 (枚举)
- php implode()函数
- Android开发读取assert下的txt文件
- Android手机连接蓝牙打印机连接不上的问题
- mac 64位 安装wxpython后报错解决方法
- 微信开发创建自定义菜单报40054错误
- Android studio 怎么设置Live Template