1035 Lunch Rush （水题）

1035 Lunch Rush （水题）

Lunch Rush

Time Limit: 2000/1000 MS (Java/Others)  Memory Limit: 128000/64000 KB (Java/Others)

Submit ​​Statistic​​​  ​​​Next Problem​​

Problem Description

Having written another programming contest, three Rabbits decided to grab some lunch. The coach gave the team exactly k time units for the lunch break.

The Rabbits have a list of n restaurants to lunch in: the i-th restaurant is characterized by two integers fi and ti. Value ti shows the time the Rabbits need to lunch in the i-th restaurant. If time ti exceeds the time k that the coach has given for the lunch break, then the Rabbits' joy from lunching in this restaurant will equali - (ti - k). Otherwise, the Rabbits get exactlyi

Your task is to find the value of the maximum joy the Rabbits can get from the lunch, depending on the restaurant. The Rabbits must choose exactly one restaurant to lunch in. Note that the joy value isn't necessarily a positive value.

Input

There are multiple cases.

For each case, the first line contains two space-separated integers — n (1 ≤ n ≤ 104) and k (1 ≤ k ≤ 100) — the number of restaurants in the Rabbits' list and the time the coach has given them to lunch, correspondingly. Each of the next n lines contains two space-separated integers —i(1 ≤ fi ≤ 104) and ti (1 ≤ ti ≤ 104) — the characteristics of the i-th

Output

In a single line print a single integer — the maximum joy value that the Rabbits will get from the lunch.

Sample Input

2 5 3 3 4 5 4 6 5 8 3 6 2 3 2 2 1 5 1 7

Sample Output

4 3 -1

Source

Codeforces

此题就是判断一个最大值的问题，不需要记录全部值，只需要记录一个最大值即可

AC代码：

#include#includeusing namespace std;int main(){ int n; long long int k,f,t,temp,mymax; while(cin>>n>>k){ mymax=-111111111111111; while(n--){ cin>>f>>t; if(t<=k){ temp=f; } else{ temp=f-(t-k); } mymax=max(temp,mymax); } cout<

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。