UVa11729

题目名称：Commando War

题目链接：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2829

Problem Description：

“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：

32 53 22 133 34 45 50

Sample Output：

Case 1: 8

Case 2: 15

题目大意：你有n个部下，每个部下都有一项任务，第 i 个部下需要你花 Bi 分钟交代任务，然后就连续执行 Ji 分钟完成任务，求全部任务做完需要最少多长时间，注意：一次只能给一个部下交代任务，部下可以同时执行他们各自的任务。

思路：明显贪心啊！画下图你会发现 Ji 较大的放前面所用时间会较少

代码如下：

#include<cstdio>#include<cstring>#include<iostream>#include<string>#include<algorithm>using namespace std;struct node{    int i,j;    bool operator < (const node k) const    {        return j>k.j;    }};int main(){    int n,k=1;    while(scanf("%d",&n)!=EOF&&n)    {        node a[1005];        int sum=0,s=0;        for(int i=0;i<n;i++)        {            scanf("%d%d",&a[i].i,&a[i].j);        }        sort(a,a+n);        for(int i=0;i<n;i++)        {            s+=a[i].i;            sum=max(sum,s+a[i].j);        }        printf("Case %d: %d\n",k++,sum);    }}