UVa11729 Commando War（贪心）

Commando War

Time Limit:1000MS     Memory Limit:0KB    64bit IO Format:%lld & %llu

Description

 

“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 away throughthe trees

Crossing their lines in the mists in the fields on our handsand our knees

And all that I ever, was able to see

The fire in the air, glowing red, silhouetting the smokeon the breeze”

 

There is a war and it doesn't look very promising for your country. Nowit's time to act. You have a commando squad at your disposal and planning anambush on an important enemy camp located nearby. You haveN soldiers inyour squad. In your master-plan, every single soldier has a uniqueresponsibility and you don't want any of your soldier to know the plan forother soldiers so that everyone can focus on his task only. In order to enforcethis, you brief every individual soldier about his tasks separately and justbefore sending him to the battlefield. You know that every single soldier needsa certain amount of time to execute his job. You also know very clearly howmuch time you need to brief every single soldier. Being anxious to finish thetotal operation as soon as possible, you need to find an order of briefing yoursoldiers that will minimize the time necessary for all the soldiers to completetheir tasks. You may assume that, no soldier has a plan that depends on thetasks of his fellows. In other words, once a soldier  begins a task, he can finish it without thenecessity of pausing in between.

 

Input

 

There will be multiple test cases in the input file. Every test casestarts with an integerN (1<=N<=1000), denoting the number ofsoldiers. Each of the 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

 

For each test case, print a line in the format, “Case X: Y”, where X isthe case number & Y is the total number of seconds counted from the startof your first briefing till the completion of all jobs.

 

Sample Input                                              Output for Sample Input

 

3 2 5 3 2 2 1 3 3 3 4 4 5 5 0

Case  1: 8 Case  2: 15

 

---

 

#include<stdio.h>
#include<algorithm>
using namespace std;
struct ss
{
    int b,j;
} s[1004];
bool cmp(ss x,ss y)
{
    if(x.j==y.j) return x.b<y.b;
    return x.j>y.j;
}
int main()
{
    int n,cas=1,ans,i,time;
    while(scanf("%d",&n),n!=0)
    {
    	ans=0;
        for(i=0; i<n; i++)
        {
            scanf("%d%d",&s[i].b,&s[i].j);
            ans+=s[i].b;
        }
        sort(s,s+n,cmp);
        time=s[0].b;
        for(i=0;i<n;i++)
		{
			if(time+s[i].j>ans)
				ans=time+s[i].j;
			time+=s[i+1].b;
		}
		printf("Case %d: %d\n",cas++,ans);
    }
    return 0;
}