Commando War
来源:互联网 发布:mac 16g内存 虚拟机 编辑:程序博客网 时间:2024/06/06 04:37
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
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 haveN 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 integerN (1<=N<=1000), denoting the number of soldiers. Each of the following N lines describe a soldier with two integersB (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 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>int main(){int n,l[1005],w[1005],d,x,e[1005],r=0,z;while(scanf("%d",&n)!=EOF&&n!=0){ x=0;for(int i=0;i<n;i++) scanf("%d%d",&l[i],&w[i]); for(int i=0;i<n-1;i++) for(int j=i+1;j<n;j++) if(w[i]<w[j]) { d=l[i],l[i]=l[j],l[j]=d; d=w[i],w[i]=w[j],w[j]=d; } x=l[0]+w[0];z=l[0]; for(int j=1;j<n;j++) { z=z+l[j]; if(z+w[j]>x) x=z+w[j]; } e[r]=x; r++;} for(int i=0;i<r;i++) printf("Case %d: %d\n",i+1,e[i]); return 0;}
- Commando War
- Commando War
- Commando War
- Commando War
- Commando War
- Commando War
- Commando War
- Commando War
- uva --11729-- Commando War
- UVa 11729 Commando War
- uva - 11729 - Commando War
- UVA 11729 - Commando War
- UVA11729--Commando War
- uva 11729 - Commando War
- Uva-11729-Commando War
- UVA 11729 - Commando War
- UVA 11729 Commando War
- Commando War(突击战)
- Ubuntu13.04下搭建Hadoop+Eclipse开发环境
- Hadoop Namenode以regular方式启动代码流程分析
- select函数详解--xinghua
- NVIDIA Legacy Texture Tools
- 数据结构实验之二叉树的建立与遍历
- Commando War
- 第三章 Spring环境设置(Spring Framework3.1教程)
- Visual C++开发工具与调试技巧整理
- 寒假训练--树与二叉树--基本操作
- 1072. Gas Station (30)
- 把一个整数按大小顺序插入已排好序的数组中。
- MySQL---federated引擎
- Wooden Sticks
- C/C++中自动类型转换的规则