P2920 [USACO08NOV]时间管理Time Management

题目描述

Ever the maturing businessman, Farmer John realizes that he must manage his time effectively. He has N jobs conveniently numbered 1..N (1 <= N <= 1,000) to accomplish (like milking the cows, cleaning the barn, mending the fences, and so on).

To manage his time effectively, he has created a list of the jobs that must be finished. Job i requires a certain amount of time T_i (1 <= T_i <= 1,000) to complete and furthermore must be finished by time S_i (1 <= S_i <= 1,000,000). Farmer John starts his day at time t=0 and can only work on one job at a time until it is finished.

Even a maturing businessman likes to sleep late; help Farmer John determine the latest he can start working and still finish all the jobs on time.

作为一名忙碌的商人，约翰知道必须高效地安排他的时间.他有N工作要 做，比如给奶牛挤奶，清洗牛棚，修理栅栏之类的.

为了高效，列出了所有工作的清单.第i分工作需要T_i单位的时间来完成，而 且必须在S_i或之前完成.现在是0时刻.约翰做一份工作必须直到做完才能停 止.

所有的商人都喜欢睡懒觉.请帮约翰计算他最迟什么时候开始工作，可以让所有工作按时完 成.

输入输出格式

输入格式：

• Line 1: A single integer: N
• Lines 2..N+1: Line i+1 contains two space-separated integers: T_i and S_i

输出格式：

• Line 1: The latest time Farmer John can start working or -1 if Farmer John cannot finish all the jobs on time.

输入输出样例

输入样例#1：

4 
3 5 
8 14 
5 20 
1 16 

输出样例#1：

2 

说明

Farmer John has 4 jobs to do, which take 3, 8, 5, and 1 units of time, respectively, and must be completed by time 5, 14, 20, and 16, respectively.

Farmer John must start the first job at time 2. Then he can do the second, fourth, and third jobs in that order to finish on time.

一开始没有理解题目的意思

以为这道题就是排个序然后判断一下第一个就好。

但是任务的时间可能会有重合的情况

所以

我们需要先以结束时间排个序（贪心）。

然后二分一个开始的点，判断一下这个开始点是否可行

 1 #include<cstdio>
 2 #include<algorithm>
 3 using namespace std;
 4 const int MAXN=100001;
 5 inline void read(int &n)
 6 {
 7     char c=getchar();bool flag=0;n=0;
 8     while(c<'0'||c>'9') c=='-'?flag==1,c=getchar():c=getchar();
 9     while(c>='0'&&c<='9')    n=n*10+c-48,c=getchar();
10 }
11 int n;
12 bool flag=0;
13 struct node
14 {
15     int need;
16     int time;
17 }mission[MAXN];
18 int comp(const node &a,const node &b)
19 {
20     return a.time<b.time;
21 }
22 bool pd(int bg)
23 {
24     int now=bg;// 做完最后一个任务的时间 
25     for(int i=1;i<=n;i++)
26     {
27         if(mission[i].time-mission[i].need>=now)
28             now+=mission[i].need;
29         else
30             return 0;
31     }
32     flag=1;
33     return 1;
34 }
35 int main()
36 {
37     read(n);
38     for(int i=1;i<=n;i++)
39         read(mission[i].need),read(mission[i].time);
40     sort(mission+1,mission+n+1,comp);
41     int l=0,r=mission[n].time;
42     int ans=0;
43     while(l<=r)
44     {
45         int mid=(l+r)>>1;
46         if(pd(mid))        l=mid+1,ans=mid;
47         else     r=mid-1;
48     }
49     flag==0?printf("-1"):printf("%d",ans);
50     return 0;
51 }