【Usaco2008Nov】【BZOJ1620】Time Management 时间管理

Description

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个工作,每个工作其所需时间,及完成的Deadline,问要完成所有工作,最迟要什么时候开始.
Input

• Line 1: A single integer: N

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

• Line 1: The latest time Farmer John can start working or -1 if Farmer John cannot finish all the jobs on time.
  Sample Input
  4
  3 5
  8 14
  5 20
  1 16

INPUT DETAILS:

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.

Sample Output
2

OUTPUT DETAILS:

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.
HINT

Source

Silver
谁翻译的题面给我站出来…
一开始想直接对每个事件根据终止时间算起始然后min就行了,WA了两发发现我真是傻逼这很显然不对…因为我TM理解错题了!
同时只有一个任务进行.
终止时间倒序排序,然后扫一遍

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define MAXN 1010 
using namespace std;
int n,ans=0x7fffffff;
struct S
{
    int t,s;
    bool operator <(const S& a)const
    {
        return s>a.s;
    }
}l[MAXN];
int main()
{
    scanf("%d",&n);
    for (int i=1;i<=n;i++)  scanf("%d%d",&l[i].t,&l[i].s);
    sort(l+1,l+n+1);
    for (int i=1;i<=n;i++)  ans=min(ans,l[i].s)-l[i].t;
    if (ans<0)  puts("-1");
    else    printf("%d\n",ans);
}