Commando War
“Waiting for orders we held in the wood, word from the front never cameBy evening the sound of the gunfire was miles awayAh softly we moved through the shadows, slip away through the treesCrossing their lines in the mists in the fields on our hands and our kneesAnd all that I ever, was able to seeThe 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. Youhave a commando squad at your disposal and planning an ambush on an important enemy camplocated nearby. You have N soldiers in your squad. In your master-plan, every single soldier has aunique responsibility and you don’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 every individual soldier abouthis tasks separately and just before sending him to the battlefield. You know that every single soldierneeds a certain amount of time to execute his job. You also know very clearly how much time youneed to brief every single soldier. Being anxious to finish the total operation as soon as possible, youneed to find an order of briefing your soldiers that will minimize the time necessary for all the soldiersto complete their tasks. You may 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 pausingin 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 twointegers B (1 ≤ B ≤ 10000) & J (1 ≤ J ≤ 10000). B seconds are needed to brief the soldier whilecompleting his job needs J seconds. The end of input will be denoted by a case with N = 0. This caseshould 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 thetotal 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
0
Sample Output
Case 1: 8
Case 2: 15
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define ll long long
#define N 1010
using namespace std;
struct zz
{
int b;
int j;
}q[N];
int cmp(zz a,zz b)
{
if(a.j==b.j)
return a.b<b.b;
return a.j>b.j;
}
int main()
{
int n,i,j,T=1;
while(scanf("%d",&n),n)
{
for(i=0;i<n;i++)
scanf("%d%d",&q[i].b,&q[i].j);
sort(q,q+n,cmp);
int sum=0;
for(i=0;i<n;i++)
{
sum+=q[i].b;
for(j=0;j<i;j++)
{
q[j].j-=q[i].b;
}
}
int mm=0;
for(i=0;i<n;i++)
mm=max(mm,q[i].j);
sum+=mm;
printf("Case %d: %d\n",T++,sum);
}
return 0;
}
