贪心算法H题

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

题意

给你一些木料，木料有两个属性长度和重量，单独加工一根木料要1个单位时间，如果下一根木料的长度和重量都大于上一根木料，则不需要额外加工时间，否则增加1个单位时间。不管怎样，都是以上一次已经加工的木料作为下一次开始加工时的参考值。

思路

此题并不复杂，设辅助数组做标记，二重循环即可。
按其中一个属性升序排序，遍历数组，如果没加工过，则判断是否满足条件（长度和重量、未被加工），满足就加工这块木料标记它，不满足就继续往下比，比完后sum++；如果被加工过，则判断下一个是否被加工。

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct wood{
    int len,wei;
}wd[5005];
bool pd[5005];
bool cmp(wood a,wood b){
    return a.len<b.len;
}
int main(){
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        for(int i=0;i<n;i++){
            cin>>wd[i].len>>wd[i].wei;
            pd[i]=false;
        }
        sort(wd,wd+n,cmp);
        int sum=0;
        for(int i=0;i<n;i++){
            if(!pd[i]){
                int tlen=wd[i].len,twei=wd[i].wei;
                for(int j=i+1;j<n;j++){
                    if(wd[j].len>=tlen&&wd[j].wei>=twei&&!pd[j]){
                        tlen=wd[j].len;
                        twei=wd[j].wei;
                        pd[j]=true;
                    }
                }
                sum++;
            }
        }
        cout<<sum<<endl;
    }
}