# Cleaning Shifts

### 思路：这是一道区间覆盖问题，先按左端点做升序排序，然后从第一个区间开始，往后找，如果后面区间左值小于第一个区间的右端点 + 1（千万注意是 + 1），则把他们都加入到优先队列中，然后选出有端点最大的那个值，依次重复这些步骤，直到右端点的值是T

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.

## 题解：

#include <iostream>
#include <queue>
#include <cstdio>
#include <algorithm>

using namespace std;

struct node{            //存储左右端点
int l, r;
};

bool cmp(node a, node b){       //按左端点升序排列
return a.l < b.l;
}

int n, T, X, Y;
node a[25005];
priority_queue<int ,vector<int>, less<int> > q;

for(int i = 0;i < n;i++){
scanf("%d%d", &a[i].l, &a[i].r);
if(a[i].l == 1) X = 1;
if(a[i].r == T) Y = 1;
}
}

int main(){
scanf("%d%d", &n, &T);

if(X == 0 || Y == 0){   //如果存在最小的左端点大于1或最大的右端点小于T的情况，则肯定不成立
printf("-1\n");
return 0;
}
sort(a, a + n, cmp);

int ans = 1, x = a[0].r, t = 1;         //ans记录区间的个数
while(x != T && t < n){
while(!q.empty()) q.pop();
while(a[t].l <= x + 1 && t < n){     //如果左端点小于前一个节点的右端点 + 1，则加入到优先队列中
q.push(a[t].r);                  //注意这里是右端点 + 1
t++;
}
if(q.empty()){
printf("-1\n");
return 0;
}
x = q.top();                 //把x赋值为右端点最大的那个值
ans++;
}
printf("%d\n",ans);

return 0;
}


©️2019 CSDN 皮肤主题: 游动-白 设计师: 上身试试