CF1846A.Rudolph and Cut the Rope
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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:
输入格式
The first line contains one integer t ( 1≤t≤104 ) — the number of test cases.
The first line of each test case contains one integer n ( 1≤n≤50 ) — the number of nails.
The i -th of the next n lines contains two integers ai and bi ( 1≤ai,bi≤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.
输出格式
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.
输入输出样例
输入#1
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
输出#1
2 2 3 0