poj 2376 区间覆盖

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
typedef pair<int,int> INTERVAL;
INTERVAL interval[25005];
int N,T;
int main(){
	int i,j,k,m,n,ans;
	xxx: while(scanf("%d%d",&N,&T)==2){
		for(i=0;i<N;i++){
			scanf("%d%d",&interval[i].first,&interval[i].second);
		}
		sort(interval,interval+N);
		int end=0,tend=0;
		for(i=0,ans=1;i<N;i++){
			if(tend>=T)break;
			if(interval[i].first>end+1){
				if(tend+1<interval[i].first){printf("-1\n");goto xxx;}
				end=tend;
				ans++;
			}
			if(tend<interval[i].second)tend=interval[i].second;
		}
		if(tend<T) printf("-1\n");
		else printf("%d\n",ans);
	}
	return 0;
}