十三、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>
using namespace std;
struct T
{
    int begin;
    int end;
    int flag;

} t[5000];

int cmp(T a,T b)
{
    if(a.begin<b.begin) return 1;
    else if(a.begin==b.begin&&a.end<=b.end) return 1;
    else return 0;

}

int main()

{

    int group;
    int line;
    int total_minute;
    int end;
    int i,j;
    cin>>group;
    while(group--)

    {   cin>>line;
        for(i=0;i<line;i++)
        {
        cin>>t[i].begin>>t[i].end;
        t[i].flag=0;}
        sort(t,t+line,cmp);
        total_minute=0;
       for(i=0;i<line;i++)
       {

           if(!t[i].flag)
           {
               end=t[i].end;
           t[i].flag=1;
           total_minute++;
           for(j=i+1;j<line;j++)
            if(!t[j].flag&&t[j].end>=end)
               {   t[j].flag=1;
                  end=t[j].end;

        }
           }
        }
        cout<<total_minute<<endl;
    }
    return 0;
}