HDU-1051 贪心 vector.erase

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
解题思路:
直觉：(๑•̀ㅂ•́)و✧
先按l,v小的排序，每次去掉满足l0<=l1&&v0<=v1的全部元素，++cnt
代码：

#include<bits/stdc++.h>
#define maxn 5005
using namespace std;
inline int read(){
    	int x=0,f=0;char ch=getchar();
    	while(ch>'9'||ch<'0')f|=ch=='-',ch=getchar();
    	while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
    	return f?-x:x;
}
struct st{
	int l,v;
	bool operator <(const st&t)const{
		return l==t.l?v<t.v:l<t.l;
	}
};
vector<st>q;
vector<st>::iterator k;
int main(){
	int t=read();
	while(t--){
		int n=read(),cnt=0;
		for(int i=0;i<n;++i)q.push_back({read(),read()});
		sort(q.begin(),q.end());
		while(!q.empty()){
			k=q.begin();
			st now=*k,next;
			for(int i=1;i<q.size();++i){
				next=q[i];
				if(now.l<=next.l&&now.v<=next.v)
					q.erase(q.begin()+i),now=next,--i;
			}
			q.erase(q.begin()),++cnt;
		}
		printf("%d\n",cnt);
	}
	return 0;
}