问题 A: Cow Jog

内存限制:128 MB 时间限制:1 S
题面:传统 评测方式:文本比较 上传者:
提交:50 通过:17

题目描述

Problem 3: Cow Jog [Mark Gordon, 2014] 
The cows are out exercising their hooves again! There are N cows jogging on an infinitely-long single-lane track (1 <= N <= 100,000). Each cow starts at a distinct position on the track, and some cows jog at different speeds. 
With only one lane in the track, cows cannot pass each other. When a faster cow catches up to another cow, she has to slow down to avoid running into the other cow, becoming part of the same running group. 
The cows will run for T minutes (1 <= T <= 1,000,000,000). Please help Farmer John determine how many groups will be left at this time. Two cows should be considered part of the same group if they are at the same position at the end of T minutes. 
题目描述

有 N (1 <= N <= 100,000)头奶牛在一个单人的超长跑道上慢跑,每头牛的起点位置都不同。由于是单人跑道,所有他们之间不能相互超越。当一头速度快的奶牛追上另外一头奶牛的时候,他必须降速成同等速度。我们把这些跑走同一个位置而且同等速度的牛看成一个小组。
请计算T (1 <= T <= 1,000,000,000)时间后,奶牛们将分为多少小组。

输入格式

The first line of input contains the two integers N and T.  
The following N lines each contain the initial position and speed of a single cow. Position is a nonnegative integer and speed is a positive integer; both numbers are at most 1 billion. All cows start at distinct positions, and these will be given in increasing order in the input. 

输入的第一行包含两个整数NT
接下来N行都包含初始位置和速度为a的一头奶牛。初始位置是一个非负整数,速度是正整数;这两个数字最大为10亿。所有奶牛都从不同的位置出发,数据会以初始位置递增的顺序给出。




输出格式

A single integer indicating how many groups remain after T minutes.
一个整数,表示在T分钟后还有多少组。

输入样例 复制

5 3
0 1
1 2
2 3
3 2
6 1

输出样例 复制

3

数据范围与提示