codeforces #321 div 2 B. Kefa and Company(尺取法)-白红宇

codeforces #321 div 2 B. Kefa and Company(尺取法)

阅读量：5115 次

发布时间：2019-06-13

本文共 2703 字，大约阅读时间需要 9 分钟。

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, $\text{[math]}$ ) — 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

input

5 100 0 7 11 32 99 10 46 8 87 54

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.

尺取直接搞...

然后因为没开longlong wa了一发...

因为看错条件,money差值等于d也会被鄙视．．．所以不能取等号...

都是傻逼错误...药丸，药丸啊...

1 /************************************************************************* 2     > File Name: code/cf/#321/B.cpp 3     > Author: 111qqz 4     > Email: rkz2013@126.com  5     > Created Time: 2015年09月25日 星期五 17时21分55秒 6  ************************************************************************/ 7  8 #include
           
             9 #include
            
             10 #include
             
              11 #include
              
               12 #include
               
                13 #include
                
                 14 #include
                 
                  15 #include
                  16 #include
                   
                    17 #include
                    
                     18 #include
                     
                      19 #include
                      
                       20 #include
                       
                        21 #define y1 hust111qqz22 #define yn hez111qqz23 #define j1 cute111qqz24 #define ms(a,x) memset(a,x,sizeof(a))25 #define lr dying111qqz26 using namespace std;27 #define For(i, n) for (int i=0;i
                        
                         >q[i].m>>q[i].f;75 sort(q,q+n,cmp);76 // for ( int i = 0 ; i < n ; i++) cout<
                         
                          <<" "<
                          
                           <

View Code

转载于:https://www.cnblogs.com/111qqz/p/4839685.html

你可能感兴趣的文章