CF276A.Lunch Rush

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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 $f_{i}$ and $t_{i}$ . Value $t_{i}$ shows the time the Rabbits need to lunch in the $i$ -th restaurant. If time $t_{i}$ exceeds the time $k$ that the coach has given for the lunch break, then the Rabbits' joy from lunching in this restaurant will equal $f_{i}-(t_{i}-k)$ . Otherwise, the Rabbits get exactly $f_{i}$ units of joy.

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.

输入格式

The first line contains two space-separated integers — $n$ ( $1<=n<=10^{4}$ ) and $k$ ( $1<=k<=10^{9}$ ) — 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 — $f_{i}$ ( $1<=f_{i}<=10^{9}$ ) and $t_{i}$ ( $1<=t_{i}<=10^{9}$ ) — the characteristics of the $i$ -th restaurant.

输出格式

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

输入输出样例

输入#1
```
2 5
3 3
4 5
```
输出#1
```
4
```
输入#2
```
4 6
5 8
3 6
2 3
2 2
```
输出#2
```
3
```
输入#3
```
1 5
1 7
```
输出#3
```
-1
```

首页