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 ( 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

PS：本来以为是一道dp问题结果wa几次，最后才发现是一个贪心问题，只要将长度或重量一个进行排序，另一个进行贪心，记录未排序的那个最少要几个递增数列可以覆盖所有长度。答案就是记录的数目。在记录时可以用一个数组标记已经有比前面大的数，还有就是每次都要更新递增序列的起点。

#include <iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<map>
#include<queue>
#include<set>
#include<cmath>
#include<stack>
#include<string>
const int maxn=1e6+5;
const int mod=1e9;
const int inf=1e9;
#define me(a,b) memset(a,b,sizeof(a))
typedef long long ll;
using namespace std;
bool vis[maxn];
struct node
{
    int l,w;
    bool friend operator<(node a,node b)
    {
        if(a.l==b.l)
            return a.w>b.w;
        return a.l>b.l;
    }
}a[maxn];
int main()
{
    int t;cin>>t;
    while(t--)
    {
        int n;cin>>n;
        for(int i=0;i<n;i++)
            scanf("%d%d",&a[i].l,&a[i].w);
        sort(a,a+n);
        int s=0;me(vis,0);
        for(int i=0;i<n;i++)
        {
            if(!vis[i])
            {
                s++;
                int temp1=a[i].l,temp2=a[i].w;
                for(int j=i+1;j<n;j++)
                    if(temp1>=a[j].l&&temp2>=a[j].w&&!vis[j])
                        temp1=a[j].l,temp2=a[j].w,vis[j]=1;
            }
        }
        cout<<s<<endl;
    }
    return 0;
}