POJ--2376--Cleaning Shifts

题目描述：
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.
输入描述:
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.
输出描述:
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.
输入：
3 10
1 7
3 6
6 10
输出：
2
题意：
有n头牛，它们都有一个工作时间的区间s至e，给定一个总的工作时间t，问最少需要多少头牛才能覆盖从1到t的工作时间.
题解：
首先我们要根据开始时间将结构体进行排序。
贪心选择性质：每次选择一个能覆盖begin起点的一个区间，然后从里面选择一个右端点最大 的区间。下一次的begin起点是选择的区间右端点+1；
代码：

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;

int n,t,ans;

struct Node{
	int s,e;
	friend bool operator <(Node n1,Node n2){
		return n1.s<n2.s;
	}
}node[26000];

int main(){
    while(scanf("%d%d",&n,&t)!=EOF){
        for(int i = 1;i <= n;i ++){
            scanf("%d %d",&node[i].s,&node[i].e);
        }
        sort(node + 1,node + 1 + n);
        int end = 0;int index = 1;
        while(end<t){
            int begin = end + 1;
            int i;
            for(i = index;i <= n; i ++){
                if(node[i].s <= begin){
                    end = max(end,node[i].e);
                }
                else break;
            }
            if(begin > end){
                cout<<-1<<endl;return 0;
            }
            else{
                ans ++;
                index = i;
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}