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;
}
相关推荐
凌冰_17 小时前
数据结构 - 时间空间复杂度(一)
数据结构·算法·软件工程
Pniubi18 小时前
力扣2 . 两数相加
算法·leetcode·职场和发展
戴·菲瑜18 小时前
为什么PPO难以做出顶级棋类引擎
算法·博弈论·rl·ppo
在所不辞兄21 小时前
为什么数字孪生驱动的产线标定需要在线更新机制,而不能一次标定后长期沿用?
人工智能·神经网络·其他·算法·机器学习
无忧.芙桃1 天前
C++语言原理与实践(二十三):哈希表的实现
c++·链表·哈希算法·散列表·哈希表
郝学胜-神的一滴1 天前
Effective Python 条款36:优雅拼装迭代器与生成器
开发语言·数据结构·人工智能·python·numpy·scikit-learn
AvocadoZeroOneOI1 天前
B4500 [GESP202603 三级] 凯撒密码 详细解题报告
c++·算法
cjz38991 天前
双指针技巧:覆盖式双指针(原地覆盖)
算法
whitelbwwww1 天前
cuBLAS--CUDA高性能线性代数计算库--第一部分
c++·线性代数·gpu算力·cuda c++
console.log('npc')1 天前
Python 学习教程 · 第4课:数据结构
数据结构·python·学习