# POJ 2376 Cleaning Shifts

Contents

$$N$$ ($$1 \le N \le 25,000$$) cows, each cow only available for a interval of time. $$T$$ ($$1 \le T \le 1,000,000$$) shifts. Find minimum number of cows to complete $$T$$ shifts.

### Notes

• Each shift must has at least one cow assigned to it.
• A cow finishes after the end time. That is, if there are two cows, start and end at $$(1, 3)$$ and $$(4, 10)$$ respectively. It is considered as an continuous internal and accepted case for $$T = 10$$.
• There can not have any gap between these cows’s working intervals.
• Use scanf() for input otherwise it will run out of the time limit.

### Solution

Sort cows by ending time. Using greedy that for each interval, find the cow which has latest end time and before the current end time. As the vector is sorted, the first cow we find is the answer.

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49  #include #include #include using namespace std; typedef pair P; vector

v; int N, T, ans = 0; struct cmp { bool operator()(const P &l, const P &r) { return l.second > r.second; } }; void solve() { sort(v.begin(), v.end(),cmp()); int cur = 1; bool find = true; while (cur <= T) { if ((v.size() == 0) || !find || (v[0].second < cur)) { ans = -1; return ; } for (int i = 0; i < v.size(); i++) { if (v[i].first <= cur) { ans++; cur = v[i].second+1; printf("%d %d\n\n", v[i].first, v[i].second); v.erase(v.begin()+i); find = true; break; } find = false; } } return ; } int main(void) { scanf("%d %d", &N, &T); int start, end; for (int i = 0; i < N; i++) { scanf("%d %d", &start, &end); v.push_back(P(start, end)); } solve(); printf("%d\n", ans); return 0; }