“Waiting for orders we held in the wood, word from the front never came By evening the sound of the gunfire was miles away Ah softly we moved through the shadows, slip away through the trees Crossing their lines in the mists in the fields on our hands and our knees And all that I ever, was able to see The fire in the air, glowing red, silhouetting the smoke on the breeze” There is a war and it doesn’t look very promising for your country. Now it’s time to act. You have a commando squad at your disposal and planning an ambush on an important enemy camp located nearby. You have N soldiers in your squad. In your master-plan, every single soldier has a unique responsibility and you don’t want any of your soldier to know the plan for other soldiers so that everyone can focus on his task only. In order to enforce this, you brief every individual soldier about his tasks separately and just before sending him to the battlefield. You know that every single soldier needs a certain amount of time to execute his job. You also know very clearly how much time you need to brief every single soldier. Being anxious to finish the total operation as soon as possible, you need to find an order of briefing your soldiers that will minimize the time necessary for all the soldiers to complete their tasks. You may assume that, no soldier has a plan that depends on the tasks of his fellows. In other words, once a soldier begins a task, he can finish it without the necessity of pausing in between. Input There will be multiple test cases in the input file. Every test case starts with an integer N (1 ≤ N ≤ 1000), denoting the number of soldiers. Each of the following N lines describe a soldier with two integers B (1 ≤ B ≤ 10000) & J (1 ≤ J ≤ 10000). B seconds are needed to brief the soldier while completing his job needs J seconds. The end of input will be denoted by a case with N = 0. This case should not be processed. Output For each test case, print a line in the format, ‘Case X: Y ’, where X is the case number & Y is the total number of seconds counted from the start of your first briefing till the completion of all jobs.

Sample Input

3

2 5

3 2

2 1

3

3 3

4 4

5 5

Sample Output

Case 1: 8

Case 2: 15

中文题解：你有n个部下，每个部下需要完成一项任务。第i个部下需要你花费bi分钟交代任务，然后他会独立地、无间断地执行Ji分钟后完成任务。你需要选择交待任务的顺序，使得所有任务尽早执行完毕（即最后一个执行完的任务应尽在结束）。注意，不能同时给两个部下交待任务，但部下们可以同时执行他们各自的任务。 

【输入格式】 
每组数据的第一行为部下的个数N（1<=N<=1000）;以下N行每行两个整数B和J(1<=B<=10000,1<=J<=10000)，即交待任务的时间和执行任务的时间。

【输出格式】 
对于每组数据，输出所有任务都完成的最短时间。

分析：题意改了改就是输入这一方面，大家应该能看出来吧。其实本题是一个贪心题目，执行任务长的任务先交代。so，本题做法：按照j从大到小的顺序给各个任务排序，然后依次交代。在代码里，j为s。

 1 #include<iostream> 2 #include<algorithm> 3 #include<vector> 4 #define maxn 10010 5 using namespace std; 6  7 int n,s,ans; 8 struct xxx{ 9     int s,k;10     bool operator < (const xxx& x) const {11      return s > x.s;12     }13 };14 vector<xxx>a;15 int main()16 {17     cin>>n;18     for(int i=0;i<n;i++) 19     {20         int b,o;21         cin>>b>>o;22         a.push_back((xxx){o,b});23     }24     sort(a.begin(),a.end());25     for(int i=0;i<n;i++)26     {27         s+=a[i].k;28         ans=max(ans,s+a[i].s);29     }30     cout<<ans<<endl;31     return 0;32 }

为什么这么说呢？

看图就明白了。。。

会发现上下两个相同的类型但最后不同的选择导致结果不同。所以我们选执行时间最长来进行贪心处理。。。

UVA 11729 Commando War 题解