Wooden Sticks

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

这是一道贪心的题目，关键在于排序后的处理，当排序后，一组量是按顺序排列，另一组量是无序的，此时我们只需要考虑无序的量即可，无论是从大到小还是从小到大，只要找到即为最优解其中的一种可能，且解的 总数不变。

#include<iostream>
#include<algorithm>
#define maxn 11000
using namespace std;


struct node{
    int a,b;
    friend bool operator <(node x,node y){
        if(x.a!=y.a) return x.a<y.a;
        else return x.b<y.b;
    }
}nd[maxn];
int n,t;
bool visited[maxn];


void solve(){
   for(int i=0;i<n;i++){
        if(visited[i]) continue;
        for(int j=i+1;j<n;j++){
            if(visited[j]) continue;
            if(nd[i].b<=nd[j].b){//成递增数列。每找到一个比nd[i]大的数要更新你的nd[i]
                visited[j]=true;
                //nd[i].a=nd[j].a;
                nd[i].b=nd[j].b;
            }
        }
   }
   int num=0;
   for(int i=0;i<n;i++){
        if(!visited[i]) num++;
   }
   cout<<num<<endl;
}


int main(){
        while(cin>>t){
            while(t-->0){
                cin>>n;
                for(int i=0;i<n;i++){
                    cin>>nd[i].a>>nd[i].b;
                    visited[i]=false;
                }
                sort(nd,nd+n);
                //for(int i=0;i<n;i++) cout<<nd[i].a<<" "<<nd[i].b<<endl;
                solve();
            }
        }
    return 0;
}