UVA - 10020（Minimal coverage）贪心+区域覆盖

Given several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would completely cover the segment [0,M].

Input

The first line is the number of test cases, followed by a blank line. Each test case in the input should contains an integer M (1 ≤ M ≤ 5000), followed by pairs “Li Ri”( |Li|,|Ri|≤ 50000, i ≤ 100000), each on a separate line. Each test case of input is terminated by pair‘ 0 0’. Each test case will be separated by a single line.

Output

For each test case, in the first line of output your programm should print the minimal number of line segments which can cover segment [0,M]. In the following lines, the coordinates of segments, sorted by their left end (Li), should be printed in the same format as in the input. Pair ‘0 0’ should not be printed. If [0,M] can not be covered by given line segments, your programm should print ‘0’ (without quotes). Print a blank line between the outputs for two consecutive test cases.

题意：给你一个目标区间[0,m]，然后判断下面的区间能否完全覆盖[0,m]。如果能，输出使用了的最小的区间数及各区间，否则输出0。
解题思路：运用贪心，每次都用区间的左端小于等于目标区间的左端且区间的右端尽可能比目标区间大的区间，即seg[i].start <= start && seg[i].end > start，如果这样最后能覆盖目标区间，这样肯定使用的区间数最少，因为我每次都尽量多地覆盖目标区间。

#include <iostream>
#include<algorithm>
using namespace std;
int vis[100010];

struct node
{
	int start, end, cover;
}seg[100010], outn[100010];

int cmp(node a, node b)
{
	return a.end > b.end;
}

int main()
{
	int ca;
	cin >> ca;
	while (ca--)
	{
		int b;
		cin >> b;
		int n=0;
		while (1)
		{
			cin >> seg[n].start >> seg[n].end;
			if (seg[n].start == 0 && seg[n].end == 0)
				break;
			n++;
		}
		sort(seg, seg + n, cmp);
		int start = 0, end = b, out = 0, i;
		while (start < end)
		{
			for (i = 0; i < n; i++)
				if (seg[i].start <= start && seg[i].end > start)
				{
					start = seg[i].end;
					outn[out++] = seg[i];
					break;
				}
			if (i == n)
				break;
		}
		if (i == n)
			cout << "0" << endl;
		else
		{
			cout << out << endl;
			for (int i = 0; i < out; i++)
				cout << outn[i].start << " " << outn[i].end << endl;
		}
		if (ca)
			cout << endl;
	}
	return 0;

}