# magic balls

Problem Description
The town of W has N people. Each person takes two magic balls A and B every day. Each ball has the volume ai and bi. People often stand together. The wizard will find the longest increasing subsequence in the ball A. The wizard has M energy. Each point of energy can change the two balls’ volume.(swap(ai,bi)).The wizard wants to know how to make the longest increasing subsequence and the energy is not negative in last. In order to simplify the problem, you only need to output how long the longest increasing subsequence is.

Input
The first line contains a single integer T(1≤T≤20)(the data for N>100 less than 6 cases), indicating the number of test cases.
Each test case begins with two integer N(1≤N≤1000) and M(0≤M≤1000),indicating the number of people and the number of the wizard’s energy. Next N lines contains two integer ai and bi(1≤ai,bi≤109),indicating the balls’ volume.

Output
For each case, output an integer means how long the longest increasing subsequence is.

Sample Input
2
5 3
5 1
4 2
3 1
2 4
3 1
5 4
5 1
4 2
3 1
2 4
3 1

Sample Output
4
4

• 写回答

#### 悬赏问题

• ¥20 python跨服务器实现复制 ，剪切的功能需求
• ¥15 android sqlite数据库如何读取显示数据(语言-java)
• ¥15 R语言，单因素cox检验，时间分层后，使用coz.zph（）函数再次ph假设检验时报错，如何解决？
• ¥15 关于#C语言冒泡排序型#的问题，如何解决？
• ¥15 如何预处理存在负值的样本数据，使其能够全都成为正的
• ¥15 SW画图拖影，平滑处理如何关闭
• ¥15 请问怎么通过css改变图片颜色
• ¥15 Blender: auto rig pro骨骼动画导出后变形穿模
• ¥15 C51单片机的设计思路哈
• ¥15 Linux脏牛提权漏洞