Wooden Sticks

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

//本题大意： 对于所给出的木棍（l,w）中找到最小的l,当长度l相等时找最小的w，找到后设长度为l，重量为w；然后再从剩下的找出比l和w都小的木棍求w最小。否则的话为非递增序列则进行t++处理；再从剩下的找出最小的l和w。输出总共多少组递增序列即t。

//代码：

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
struct node{
	int l,w;
	int flag;
}a[5005];
int cmp(struct node a,struct node b)
{	
		if(a.l<b.l)
			return 1;
		else
		if(a.l==b.l)
	    	return a.w<b.w;
		return 0;	
}
int main()
{
	int t,n,i,j;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			scanf("%d%d",&a[i].l,&a[i].w);
			a[i].flag=0;
		}
		sort(a,a+n,cmp);  
		//for(i=0;i<n;i++)
		//	printf("%d %d\n",a[i].l,a[i].w);		
		int t=0;
		for(i=0;i<n;i++)
		{
			
			if(!a[i].flag)
			{
				a[i].flag=1;
				t++;
				int w=a[i].w;				
				for(j=i+1;j<n;j++) 
				{
					if(!a[j].flag&&a[j].w>=w)
					{
						w=a[j].w;
						a[j].flag=1;
					}
				}
		    }
		}
		printf("%d\n",t);
	}
	return 0;
}