E - Wooden Sticks

E - Wooden Sticks

Time Limit:1000MS    Memory Limit:32768KB    64bit IO Format:%I64d & %I64u

Submit Status

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 

     
     解答：

     
     
#include<stdio.h>
int main()
{
	int i,j,k,t;
	int a,b;
	int c[10001],d[10001],f[10001]={0};
	scanf("%d",&a);
	while(a--)
	{k=0;f[0]=0;
		scanf("%d",&b);
		for(i=0;i<b;i++)   //此类题的一般思路就是先根据一个标准排序，然后又根据另一标准选择！ 
		scanf("%d%d",&c[i],&d[i]);
		for(i=0;i<b;i++)
		{
			for(j=0;j<i;j++)
			{
			if(c[i]<c[j])
			{
				t=c[i];c[i]=c[j];c[j]=t;
				t=d[i];d[i]=d[j];d[j]=t;
			}
			else if(c[i]==c[j])
			{
				if(d[i]<d[j])
				{
				t=c[i];c[i]=c[j];c[j]=t;
				t=d[i];d[i]=d[j];d[j]=t;
			}
			}
			}
		}
		for(i=0;i<b;i++)
		{
				for(j=0;j<=k;j++)  
				{
				if(d[i]>=f[j])
				{
				f[j]=d[i];
				break;
				}
	        	else if(j==k)
	        	{
				f[++k]=d[i];
				break;
	        	}
				
				}
		}
		printf("%d\n",k+1);
	}
	return 0;
		
	}