<cite id="nzhfv"><strike id="nzhfv"><thead id="nzhfv"></thead></strike></cite>
<ins id="nzhfv"><span id="nzhfv"><var id="nzhfv"></var></span></ins><cite id="nzhfv"></cite>
<cite id="nzhfv"><span id="nzhfv"></span></cite>
<ins id="nzhfv"></ins>
<cite id="nzhfv"><video id="nzhfv"></video></cite><cite id="nzhfv"><video id="nzhfv"><var id="nzhfv"></var></video></cite><ins id="nzhfv"><span id="nzhfv"><cite id="nzhfv"></cite></span></ins><ins id="nzhfv"><video id="nzhfv"><var id="nzhfv"></var></video></ins>
<var id="nzhfv"><video id="nzhfv"></video></var>
Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register
Language:
Wooden Sticks
Time Limit: 1000MSMemory Limit: 10000K
Total Submissions: 29397Accepted: 12749

Description

There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows:
(a) The setup time for the first wooden stick is 1 minute.
(b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l' and weight w' if l <= l' and w <= w'. Otherwise, it will need 1 minute for setup.
You are to find the minimum setup time to process a given pile of n wooden sticks. For example, if you have five sticks whose pairs of length and weight are ( 9 , 4 ) , ( 2 , 5 ) , ( 1 , 2 ) , ( 5 , 3 ) , and ( 4 , 1 ) , then the minimum setup time should be 2 minutes since there is a sequence of pairs ( 4 , 1 ) , ( 5 , 3 ) , ( 9 , 4 ) , ( 1 , 2 ) , ( 2 , 5 ) .

Input

The input consists of T test cases. The number of test cases (T) is given in the first line of the input file. Each test case consists of two lines: The first line has an integer n , 1 <= n <= 5000 , that represents the number of wooden sticks in the test case, and the second line contains 2n positive integers l1 , w1 , l2 , w2 ,..., ln , wn , each of magnitude at most 10000 , where li and wi are the length and weight of the i th wooden stick, respectively. The 2n integers are delimited by one or more spaces.

Output

The output should contain the minimum setup time in minutes, one per line.

Sample Input

3 
5 
4 9 5 2 2 1 3 5 1 4 
3 
2 2 1 1 2 2 
3 
1 3 2 2 3 1 

Sample Output

2
1
3

Source

[Submit]   [Go Back]   [Status]   [Discuss]

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator

国语自产拍在线视频中文,国语自产拍在线观看学生,国语自产精品视频在线视频
<cite id="nzhfv"><strike id="nzhfv"><thead id="nzhfv"></thead></strike></cite>
<ins id="nzhfv"><span id="nzhfv"><var id="nzhfv"></var></span></ins><cite id="nzhfv"></cite>
<cite id="nzhfv"><span id="nzhfv"></span></cite>
<ins id="nzhfv"></ins>
<cite id="nzhfv"><video id="nzhfv"></video></cite><cite id="nzhfv"><video id="nzhfv"><var id="nzhfv"></var></video></cite><ins id="nzhfv"><span id="nzhfv"><cite id="nzhfv"></cite></span></ins><ins id="nzhfv"><video id="nzhfv"><var id="nzhfv"></var></video></ins>
<var id="nzhfv"><video id="nzhfv"></video></var>