# Commando War

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

[Submit]   [Go Back]   [Status]

Description

 G Commando War Input: Standard Input Output: Standard Output

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

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)seconds are needed to brief the soldier while completing his job needs 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                                               Output for Sample Input

 3 2 5 3 2 2 1 3 3 3 4 4 5 5 0 Case 2: 15

#include<iostream>
#include<algorithm>
using namespace std;
struct mm{int x,y;};
bool cmp(mm &a,mm &m)
{
return a.y<m.y;

}
mm a[1005];
int sn=0,n,j,k,i;
int main()
{

while(cin>>n&&n)
{
sn++;
for(i=0;i<n;i++)
cin>>a[i].x>>a[i].y;
sort(a,a+n,cmp);
int cus=0;
cus=a[0].x+a[0].y;
for(i=1;i<n;i++)
{
if(a[i].y>cus)
cus=a[i].y;
cus+=a[i].x;

}
cout<<"Case "<<sn<<": "<<cus<<endl;
}
return 0;
}

©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客