Commando War
来源:互联网 发布:win ubuntu 双系统 编辑:程序博客网 时间:2024/06/05 15:37
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 have N 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 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). 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>#include<algorithm>using namespace std;struct note{ int b; int j;}a[1010];bool cmp(note x,note y){ return x.j>y.j;}int main(){ int n,i,j=1,s[1010]; while(scanf("%d",&n)&&n) { for(i=0;i<n;i++) scanf("%d%d",&a[i].b,&a[i].j); sort(a,a+n,cmp); s[0]=a[0].b+a[0].j; int max=s[0]; for(i=1;i<n;i++) { s[i]=s[i-1]+a[i].b-a[i-1].j+a[i].j;//每个士兵执行完任务所需时间 if(max<s[i])//找出时间最长的 max=s[i]; } printf("Case %d: %d\n",j++,max); } 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(突击战)
- java Swing组件大全
- hadoop 中文wiki
- 如何取datatable的前N行
- GitHub“最受欢迎的开源项目” TOP 50 android开源项目 直接拿来用
- ACM竞赛题:制作万年历法二
- Commando War
- 初步学习mongo数据库的安装
- maven打可执行jar包
- E - Wooden Sticks
- Wav文件格式解析
- android把系统路径转化成file
- 微软报表rdlc有类似dephi的FastReport的<运行时报表 最终用户 调节位置>功能吗?
- VC导出数据到EXCEL
- mysql max_allowed_packet查询和修改