Uva---11729Commando War(贪心)
来源:互联网 发布:风资源模拟软件 编辑:程序博客网 时间:2024/05/06 23:13
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 Nsoldiers 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<string.h>#include <math.h>#include <iostream>#include <algorithm>using namespace std;#define N 20010typedef struct{ int x,y;}LNode;LNode f[N];int cmp(const void *a,const void *b){ return ((*(LNode*)a).y<(*(LNode*)b).y);}// 将J按照从小到大的顺序排序,然后依次交待任务即可。int main(){ int i,j,k,n,m,t;k=1; while(scanf("%d",&n) && n){ int num=0; for(i=0;i<n;i++){ scanf("%d %d",&f[i].x,&f[i].y); num=num+f[i].x;//交代所有任务的总时间; } qsort(f,n,sizeof(f[0]),cmp);//从大到小排序; t=0; for(i=0;i<n;i++){ t=t+f[i].x; //到目前,交待任务的总时间。 if((t+f[i].y)>num) num=t+f[i].y; } printf("Case %d: %d\n",k++,num); } return 0;}
- uva 11729 Commando War(贪心)
- uva 11729 - Commando War(贪心)
- UVA 11729 - Commando War(贪心)
- Uva---11729Commando 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 (贪心)
- 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 (贪心)
- 7.css综合案例---仿sohu网站首页布局
- 8.学习javascript
- 9. js的学习
- 新时代前端必备神器 Snap.svg 之弹动效果
- Uva---11292Problem C: The Dragon of Loowater (贪心)
- Uva---11729Commando War(贪心)
- Uva---11300 F. Spreading the Wealth (数学推理)---与数列有关的最小值一般与中位数有关
- Uva---11520Problem A Fill the Square (贪心+模拟)
- 第一章:算法设计基础(思维体操+常见策略+高效算法+动态规划)
- 训练指南---总结
- Uva---1398Meteor
- 引用变量名
- 第二章:数学基础(组合计数+递推)
- 第二章:数学基础(数论+组合游戏+概率论)