Problem 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 (4,9), (5,2), (2,1), (3,5), and (1,4), then the minimum setup time should be 2 minutes since there is a sequence of pairs (1,4), (3,5), (4,9), (2,1), (5,2).

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 n 2 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

題意：

我們要處理一些木棍，第一根的時間是1分鐘，另外的，在長度為l，重為w的木棍后面的那根的長度為l', 重量w'，只要l <=l' 并且w <= w'，就不需要時間，否則需要1分鐘，求如何安排處理木棍的順序，才能使花的時間最少。

思路：

貪心算法。先把這些木棍按長度和重量都從小到大的順序排列。cl和cw是第一根的長度和重量，依次比較后面的是不是比當前的cl，cw大，是的話把標志flag設為1，并跟新cl,cw。比較完后，再從前往后掃描，找到第一個標志位為0的，作為是第二批的最小的一根，計數器加一。把它的長度和重量作為當前的cl，cw，再循環往后比較。直到所有的都處理了。