用Vector容器实现Hdu 1051（贪心算法）

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

解题思路

定义一个vector结构体数组p，将每根木棍的长度和重量存入动态数组p中，用sort函数按长度参数从小到大排序（如果长度相同，则按照重量从小到大排序）

bool cmp(node a, node b)
{
	if (a.length == b.length) return a.weight < b.weight;
	else return a.length < b.length;
}
sort(p.begin(), p.end(), cmp);。

而后，设置一个临时结构体指针变量flag初始值为p[0]，开始遍历整个数组，如果p[i]满足条件，则将flag指向p[i]，且将p[i]删除，每循环一次将p.begin()删除，count++。直到p为空，输出count。

while(!p.empty())
		{
			node flag = p[0];
			for (int i = 1, m = 1; i < p.size(); i++,m++)
			{
				if (p[i].length >= flag.length && p[i].weight >= flag.weight) 
				{
					flag = p[i]; p.erase(p.begin() + i); i--;
				}
				else continue;
			}
			no++; p.erase(p.begin());
		}

sort(p.begin(), p.end(), cmp);。

完整代码

#include<bits/stdc++.h>
#define N 5000

using namespace std;
ifstream in("input.txt");
int T;
int n;
int no=0;
typedef struct node
{
	int length;
	int weight;
};
vector <node> p;
node text;
bool cmp(node a, node b)
{
	if (a.length == b.length) return a.weight < b.weight;
	else return a.length < b.length;
}
int main()
{
	in >> T;
	while (T--)
	{
		in >> n;
		int temp;
		for (int i = 0; i < n; i++)
		{
			in >> text.length >> text.weight;
			//if (text.length > text.weight) { temp = text.length; text.length = text.weight; text.weight = temp; }
			p.push_back(text);
		}
		sort(p.begin(), p.end(), cmp);
		//cout << p.empty() << endl;
		int m;
		while(!p.empty())
		{
			node flag = p[0];
			for (int i = 1, m = 1; i < p.size(); i++,m++)
			{
				if (p[i].length >= flag.length && p[i].weight >= flag.weight) {
					flag = p[i]; p.erase(p.begin() + i); i--;
				}
				else {continue; 
			}
			}
			no++; p.erase(p.begin());
		}
		cout << no << endl; no = 0; p.clear();
	}
}