HDOJ 1051 Wooden Sticks 贪心again! so easy!

check the problem:http://acm.hdu.edu.cn/showproblem.php?pid=1051

ac code:(use vector)

#include<iostream>
#include<string>
#include <cstdio>
#include <cmath>
#include<vector>
#include<algorithm>
#include<sstream>
#include<cstdlib>
using namespace std;
struct wood{
	int ln,wn;
	int flag;
};
bool comp(wood a,wood b){
	if(a.ln!=b.ln)return a.ln<=b.ln;
	else return a.wn<=b.wn;
}
int main()
{
	vector<wood> buf;
	int t;
	cin>>t;
	wood tmp;
	while(t--)
	{
		int n,ti=0;
		cin>>n;
		for(int i=0;i<n;i++)
		{
			cin>>tmp.ln>>tmp.wn;
			tmp.flag=0;
			buf.push_back(tmp);
		}
		sort(buf.begin(),buf.end(),comp);
		for(vector<wood>::size_type i=0;i!=buf.size();i++)
		{
			if(buf[i].flag==0){
				tmp=buf[i];
				tmp.flag=1;
				for(vector<wood>::size_type j=i+1;j!=buf.size();j++){
					if(buf[j].flag==0&&(tmp.wn<=buf[j].wn)){
						buf[j].flag=1;
						tmp=buf[j];
					}
				}
				ti++;
			}
			
		}
		cout<<ti<<endl;
		buf.clear();
	}
	return 0;
}