UVA 11729 - Commando War(贪心)
来源:互联网 发布:淘宝点击量和访客数 编辑:程序博客网 时间:2024/04/29 09:07
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 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
题意:你有n个部下,每个部下需要完成一项任务,第i个部下要B分钟交代,j分钟完成任务,问一个交代任务顺序使得完成时间最少。
思路:贪心,优先交代完成时间久的。
代码:
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;const int MAXN = 10005;struct S { int b, j;} s[MAXN];int n, ans, sum;int cmp(S a1, S a2) { return a1.j > a2.j;}int main() { int cas = 0; while (~scanf("%d", &n) && n) {ans = 0, sum = 0;for (int i = 0; i < n ; i ++) scanf("%d%d", &s[i].b, &s[i].j);sort(s, s + n, cmp);for (int i = 0; i < n; i ++) { sum += s[i].b; ans = max(ans, s[i].j + sum);}printf("Case %d: %d\n", ++cas, ans); } return 0;}
- Commando War UVa 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 Commando War 11729 (贪心)
- UVa 11729 - Commando War(贪心)
- Uva 11729 Commando War【贪心】
- UVA 11729 Commando War(贪心)
- |UVA 11729|贪心|Commando War
- Commando War-uva 贪心
- uva 11729 Commando War(贪心)
- UVA 11729(Commando War-按执行时间贪心)
- UVA 11729 Commando War 贪心的思想
- Uva 11729 - Commando War ( 贪心 + 水 )
- hdu 1754 I Hate It (线段树)
- OpenCV: 高斯滤波
- Apidemo 学习 Regions RoundRects ScaleToFit
- Poj 1101 The Game(广搜,优先级:优先队列或者其他)
- 堆排序
- UVA 11729 - Commando War(贪心)
- uva 1352 - Colored Cubes(枚举)
- CFile参数modeNoTruncate
- java中写入文件的方法
- 黑客与画家经典
- wikioi 1043 方格取数
- template<class T>
- nyoj 40公约数和公倍数(辗转相除)
- [转]出现蓝屏代码stop ** 0x000000a5(0x00000001,0x89758d98,0x000000000,0x00000000)