A. Rudolph and Cut the Rope

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There are n� nails driven into the wall, the i�-th nail is driven ai�� meters above the ground, one end of the bi�� meters long rope is tied to it. All nails hang at different heights one above the other. One candy is tied to all ropes at once. Candy is tied to end of a rope that is not tied to a nail.

To take the candy, you need to lower it to the ground. To do this, Rudolph can cut some ropes, one at a time. Help Rudolph find the minimum number of ropes that must be cut to get the candy.

The figure shows an example of the first test:

Input

The first line contains one integer t� (1≤t≤1041≤�≤104) --- the number of test cases.

The first line of each test case contains one integer n� (1≤n≤501≤�≤50) --- the number of nails.

The i�-th of the next n� lines contains two integers ai�� and bi�� (1≤ai,bi≤2001≤��,��≤200) --- the height of the i�-th nail and the length of the rope tied to it, all ai�� are different.

It is guaranteed that the data is not contradictory, it is possible to build a configuration described in the statement.

Output

For each test case print one integer --- the minimum number of ropes that need to be cut to make the candy fall to the ground.

Example

input

Copy

复制代码

4

3

4 3

3 1

1 2

4

9 2

5 2

7 7

3 4

5

11 7

5 10

12 9

3 2

1 5

3

5 6

4 5

7 7

output

Copy

复制代码
2
2
3
0

解题说明:水题,此题分析一下就能发现,只要绳子长度小于高度,那就必须要切断才能让糖果落地,直接判断即可。

cpp 复制代码
#include<stdio.h>
int main()
{
	int m, n, a, b, ans;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		ans = 0;
		scanf("%d", &m);
		for (int j = 0; j < m; j++)
		{
			scanf("%d %d", &a, &b);
			if (a > b)
			{
				ans++;
			}
		}
		printf("%d\n", ans);
	}
	return 0;
}
相关推荐
森焱森18 分钟前
水下航行器外形分类详解
c语言·单片机·算法·架构·无人机
QuantumStack2 小时前
【C++ 真题】P1104 生日
开发语言·c++·算法
天若有情6732 小时前
01_软件卓越之道:功能性与需求满足
c++·软件工程·软件
whoarethenext2 小时前
使用 C++/OpenCV 和 MFCC 构建双重认证智能门禁系统
开发语言·c++·opencv·mfcc
写个博客3 小时前
暑假算法日记第一天
算法
绿皮的猪猪侠3 小时前
算法笔记上机训练实战指南刷题
笔记·算法·pta·上机·浙大
hie988944 小时前
MATLAB锂离子电池伪二维(P2D)模型实现
人工智能·算法·matlab
Jay_5154 小时前
C++多态与虚函数详解:从入门到精通
开发语言·c++
杰克尼4 小时前
BM5 合并k个已排序的链表
数据结构·算法·链表
.30-06Springfield4 小时前
决策树(Decision tree)算法详解(ID3、C4.5、CART)
人工智能·python·算法·决策树·机器学习