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;
}
相关推荐
CoovallyAIHub3 分钟前
从FCOS3D到PGD:看深度估计如何快速搭建你的3D检测项目
深度学习·算法·计算机视觉
偷偷的卷31 分钟前
【算法笔记 day three】滑动窗口(其他类型)
数据结构·笔记·python·学习·算法·leetcode
北京地铁1号线37 分钟前
Zero-Shot(零样本学习),One-Shot(单样本学习),Few-Shot(少样本学习)概述
人工智能·算法·大模型
大白的编程日记.44 分钟前
【计算机基础理论知识】C++篇(二)
开发语言·c++·学习
C语言小火车1 小时前
野指针:C/C++内存管理的“幽灵陷阱”与系统化规避策略
c语言·c++·学习·指针
凤年徐1 小时前
【数据结构】时间复杂度和空间复杂度
c语言·数据结构·c++·笔记·算法
kualcal1 小时前
代码随想录17|二叉树的层序遍历|翻转二叉树|对称二叉树
数据结构·算法
踏莎行hyx1 小时前
使用langchain连接llama.cpp部署的本地deepseek大模型开发简单的LLM应用
c++·ai·langchain·大模型·llama.cpp·deepseek
山河木马1 小时前
前端学C++可太简单了:双冒号 :: 操作符
前端·javascript·c++
满分观察网友z2 小时前
从混乱到有序:我用“逐层扫描”法优雅搞定公司组织架构图(515. 在每个树行中找最大值)
后端·算法