UVA 11729-Commando War(排序分任务)
来源:互联网 发布:伍聚网络股票 编辑:程序博客网 时间:2024/06/08 05:52
Commando War
“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 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
32 53 22 133 34 45 531 101 91 80
题目意思:
你有N个部下,每个人需要完成一项任务。第i个部下需要你花Bi分钟交代任务,然后他会立刻独立且无间断的执行Ji分钟后完成任务。你需要选择交代任务的顺序,使得所有任务尽早执行完毕(最后一个执行完的任务应该尽早结束)。注意:不能同时给两个部下交代任务,但是部下们可以同时执行他们的任务。求所有任务完成的最短时间。
解题思路:
按照J从大到小的顺序给各个任务排序,然后依次交待。
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define maxn 20010struct N{ int b,j;//交代、执行};N a[maxn];int cmp(N x,N y)//结构体排序{ return (x.j>y.j);//大到小}int main(){ int n,ca=0; while(scanf("%d",&n)&&n!=0) { int t=0,ans=0; for(int i=0; i<n; ++i) scanf("%d%d",&a[i].b,&a[i].j); sort (a,a+n,cmp); for(int i=0; i<n; ++i) { t+=a[i].b; ans=max(ans,t+a[i].j); } printf("Case %d: %d\n",++ca,ans); } return 0;}/*32 53 22 133 34 45 531 101 91 80*/
- UVA 11729-Commando War(排序分任务)
- UVA 11729 Commando War(排序+贪心)
- UVA-11729 - Commando War(贪心、排序)
- UVa - 11729 - Commando War ( 排序+贪心 )
- UVa Commando War-11729(排序+贪心)
- uva --11729-- Commando War
- UVa 11729 Commando War
- uva - 11729 - Commando War
- UVA 11729 - Commando War
- uva 11729 - Commando War
- Uva-11729-Commando War
- UVA 11729 - Commando War
- UVA 11729 Commando War
- UVA 11729 - Commando War
- UVA 11729 Commando War
- UVA 11729 - Commando War
- Commando War, UVa 11729
- UVa 11729 - Commando War
- 第九周项目3-稀疏矩阵的三元组表示的实现及应用(2)
- 欢迎使用CSDN-markdown编辑器
- 第十周项目3--利用二叉树遍历思想解决问题--判断二叉树相似
- 堆与栈在内存里是怎么分配的?
- 进程进入不了下一function
- UVA 11729-Commando War(排序分任务)
- linux内核双向链表学习
- N-armed bandit problem
- SpringMVC入门案例——注解配置方式
- OpenCV函数estimateRigidTransform 使用心得
- 【UVALive 7505】Hungry Game of Ants(DP)
- 数学之美3
- Oracles数据库 修改表名 列名 字段类型 语句
- Android_listview_video安卓列表视频直接播放