CodeForces
来源:互联网 发布:高峰于谦 知乎 编辑:程序博客网 时间:2024/06/08 00:22
题目网址: http://codeforces.com/problemset/problem/777/A
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 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<iostream>#include<algorithm>using namespace std;struct node{ int m,s;}no[100005];bool cmp(node x,node y){ return x.m<y.m;}int main(){ int n,d,i,j; long long int maxn; long long int sum1,sum2; while(~scanf("%d%d",&n,&d)){ maxn=0; for(i=0;i<n;i++){ scanf("%d%d",&no[i].m,&no[i].s); } sort(no,no+n,cmp); sum1=0;sum2=0; j=0; for(i=0;i<n;){ if(no[i].m-no[j].m>=d){ sum2-=no[j].s; j++; } else{ sum2+=no[i].s; i++; } maxn=max(maxn,sum2); } printf("%lld\n",maxn); } return 0;}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Maven配置阿里镜像,提高下载依赖依赖
- 蓝桥杯 历届试题 剪格子 (dfs回溯)
- Android控件无法在Unity 5.6.x上显示的问题
- Python读取Excel文件遇到的编码问题(pycharm)
- MySQL
- CodeForces
- 51nod 1020 逆序排列(dp)
- Bootstrap按钮
- MSER算法
- Mongodb 常用命令
- 2017.5.16
- 存题
- Java日期格式转换
- spark.sql.hive.convertMetastoreParquet参数优化