UVA11729 Commando War

Commando War

Input: Standard Input

Output: Standard Output

 

 

“Waiting for orders we held in the wood, word from thefront never came

By evening the sound of the gunfire was miles away

Ah softly we moved through the shadows, slip awaythrough the trees

Crossing their lines in the mists in the fields on ourhands and our knees

And all that I ever, was able to see

The fire in the air, glowing red, silhouetting thesmoke on the breeze”

 

Thereis a war and it doesn't look very promising for your country. Now it's time toact. You have a commando squad at your disposal and planning an ambush on animportant enemy camp located nearby. You haveN soldiers in your squad.In your master-plan, every single soldier has a unique responsibility and youdon't want any of your soldier to know the plan for other soldiers so thateveryone can focus on his task only. In order to enforce this, you brief everyindividual soldier about his tasks separately and just before sending him tothe battlefield. You know that every single soldier needs a certain amount oftime to execute his job. You also know very clearly how much time you need tobrief every single soldier. Being anxious to finish the total operation as soonas possible, you need to find an order of briefing your soldiers that willminimize the time necessary for all the soldiers to complete their tasks. Youmay assume that, no soldier has a plan that depends on the tasks of hisfellows. In other words, once a soldier begins a task, he can finish it without the necessity of pausing inbetween.

 

Input

 

Therewill be multiple test cases in the input file. Every test case starts with anintegerN (1<=N<=1000), denoting the number of soldiers. Each ofthe following N lines describe a soldier with two integersB(1<=B<=10000) & J (1<=J<=10000). B secondsare 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 shouldnot be processed.

 

Output

 

Foreach test case, print a line in the format, “Case X: Y”, where X is the casenumber & Y is the total number of seconds counted from the start of yourfirst briefing till the completion of all jobs.

Sample Input  

3

2 5

3 2

2 1

3

3 3

4 4

5 5

0

 Output for Sample Input

Case 1: 8

Case 2: 15

 

解题思路：

1、先给做事时间最长的士兵交代任务

2、完成任务的时间=等待时间+交代时间+做的时间。

3、总用时为结束时间最晚士兵用的总时间

#include<cstdio> #include<algorithm> using namespace std; struct data {    int wait;    int do1; }time[1002]; bool cmp(struct data a,struct data b) {     if(a.do1==b.do1)         return a.wait<b.wait;     return a.do1>b.do1; } int main() {     int n;     int i,j,k=1;     int t;     int max;     while(scanf("%d",&n)&&n)     {         t=0;         max=0;      //每组测试案例记得初始化数据，我就在这里WA2次，后面才发现         for(i=0;i<n;i++)             scanf("%d%d",&time[i].wait,&time[i].do1);         sort(time,time+n,cmp);         for(i=0;i<n;i++)         {             t+=time[i].wait;    //等待时间情况（等待时间+交代时间）             if(time[i].do1+t>max)       //完成任务的时间=等待时间+交代时间+做的时间。总用时为结束时间最晚士兵用的总时间                 max=time[i].do1+t;         }         printf("Case %d: %d\n",k++,max);     }     return 0; }