入门练习-贪心(4)POJ-2376牛棚清洁

POJ-2376
Farmer John is assigning some of his N (1 <= N <= 25,000) cows to do some cleaning chores around the barn. He always wants to have one cow working on cleaning things up and has divided the day into T shifts (1 <= T <= 1,000,000), the first being shift 1 and the last being shift T.

Each cow is only available at some interval of times during the day for work on cleaning. Any cow that is selected for cleaning duty will work for the entirety of her interval.

Your job is to help Farmer John assign some cows to shifts so that (i) every shift has at least one cow assigned to it, and (ii) as few cows as possible are involved in cleaning. If it is not possible to assign a cow to each shift, print -1.
Input

• Line 1: Two space-separated integers: N and T

• Lines 2…N+1: Each line contains the start and end times of the interval during which a cow can work. A cow starts work at the start time and finishes after the end time.
  Output

• Line 1: The minimum number of cows Farmer John needs to hire or -1 if it is not possible to assign a cow to each shift.
  Sample Input
  3 10
  1 7
  3 6
  6 10
  Sample Output
  2
  Hint
  This problem has huge input data,use scanf() instead of cin to read data to avoid time limit exceed.

INPUT DETAILS:

There are 3 cows and 10 shifts. Cow #1 can work shifts 1…7, cow #2 can work shifts 3…6, and cow #3 can work shifts 6…10.

OUTPUT DETAILS:

By selecting cows #1 and #3, all shifts are covered. There is no way to cover all the shifts using fewer than 2 cows.
题意
给分配N头牛，每头牛只能以一定的间隔使用白天进行清洁工作的次数。任何被选定负责清洁工作的母牛将在整个间隔时间内工作。

您的工作是帮助农夫约翰分配一些奶牛到班次，以便（i）每个班次分配至少一头奶牛，并且（ii）尽可能少地母牛参与清洁工作。如果无法为每个班次分配母牛，则打印-1。
输入：
第1行：两个以空格分隔的整数：N和T
第2…N + 1行：每行包含母牛可以工作的时间间隔的开始和结束时间。母牛在开始时间开始工作，在结束时间之后结束。
输出
农夫约翰需要雇用的最小母牛数或-1。
样本输入
3 10
1 7
3 6
6 10
样本输出
2
提示
此问题有大量输入数据，请使用scanf（）而不是cin读取数据，以避免超过时间限制。

输入详细信息：

有3头母牛和10个班次。＃1奶牛可以上班1…7，＃2牛可以上班3…6，而＃3牛可以上班6…10。

输出详细信息：

通过选择1号和3号奶牛，所有班次都包括在内。没有办法使用少于2头母牛来覆盖所有班次。