Problem I-1008

概述：问题同Problem-B-1001.

思路：同1001

#include<iostream>
#include<algorithm>
#include<fstream>


using namespace std;
struct wood                               //定义一组结构体，用来表示长和宽
{
	int longs;
	int weight;
	int flag;
}strick[5001];

bool cmp(const wood &a, const wood &b)        //定义cmp排序顺序，先进行长度排序，当长度相同时进行重量排序，输出从大到小
{
	if (a.longs != b.longs)
		return a.longs > b.longs;
	else
		return a.weight > b.weight;
}

int main()
{
	//ifstream cin("cin.txt");
	int T;
	cin >> T;
	while (T--)
	{
		int n, num, min = 0;
		cin >> n;
		for (int i = 0;i < n;i++)
		{
			cin >> strick[i].longs >> strick[i].weight;
			strick[i].flag = 0;
		}
		sort(strick, strick + n, cmp);
		num = 0;
		for (int i = 0;i < n;i++)
		{
			if (strick[i].flag) continue;
			min = strick[i].weight;
			for (int j = i + 1;j < n;j++)
			{
				if (min >= strick[j].weight&&!strick[j].flag)
				{
					min = strick[j].weight;
					strick[j].flag = 1;
				}
			}
			num++;

		}
		cout << num << endl;
	}
	//system("pause");
	return 0;
}