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;
}
相关推荐
qq_4798754320 分钟前
C++ std::Set<std::pair>
开发语言·c++
he___H3 小时前
数据结构-移位
数据结构
云知谷3 小时前
【C++基本功】C++适合做什么,哪些领域适合哪些领域不适合?
c语言·开发语言·c++·人工智能·团队开发
电子_咸鱼3 小时前
LeetCode——Hot 100【电话号码的字母组合】
数据结构·算法·leetcode·链表·职场和发展·贪心算法·深度优先
仰泳的熊猫3 小时前
LeetCode:785. 判断二分图
数据结构·c++·算法·leetcode
^Moon^3 小时前
CycloneDDS:跨主机多进程通信全解析
c++·分布式·dds
rit84324993 小时前
基于MATLAB实现基于距离的离群点检测算法
人工智能·算法·matlab
C_Liu_5 小时前
C++:list
开发语言·c++
my rainy days5 小时前
C++:友元
开发语言·c++·算法
haoly19895 小时前
数据结构和算法篇-归并排序的两个视角-迭代和递归
数据结构·算法·归并排序