UVA 11729 Commando War
2016-06-27 14:19
477 查看
UVA 11729 [Commando War]
目录
UVA 11729 Commando War目录
Description
input
output
代码
Description
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.3
2 5
3 2
2 1
3
3 3
4 4
5 5
0
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.Case 1: 8
Case 2: 15
代码
#include <iostream> #include<algorithm> using namespace std; class Soild { public: int lis,work; bool operator<(const Soild x) const { return work<x.work; } }; int main() { int n,_case=0; Soild team[1010]; while(cin>>n&&n!=0) { for(int i=0;i<n;i++)cin>>team[i].lis>>team[i].work; sort(team,team+n); int pay=0,work=0; for(int i=n-1;i>=0;i--) { pay+=team[i].lis; if(work<(pay+team[i].work)) work=pay+team[i].work; } cout<<"Case "<<++_case<<": "<<work<<endl; } return 0; }
相关文章推荐
- threadLocal的比喻很到位
- 检测创建文件或删除文件会报告:信号处理机制
- DZNEmptyDataSet使用(UItabelView 数据为空时 显示图)
- jQuery的deferred对象详解
- 【数字图像处理学习笔记之三】Blob分析
- 彻底理解View事件体系!
- cmake 查看配置选项
- MCU51单片机uIP协议栈+ENC28J60网卡 移植、应用
- Linux MTD系统剖析
- DVRRDK, EZSDK和DVSDK这三者有什么区别
- 为 URLDownloadToFile 函数实现进度条
- oracle分页在ibatis中配置代码块
- 通过Form类来获取DEV的BarManager控件。
- 关于Android 开发中的一些常用框架
- LeetCode 357 Count Numbers with Unique Digits
- Editext去掉视觉回显
- .NET之特性和属性
- 迭代器理解函数返回值与返回结果
- Android StatusBarUtil:设置Android系统下方虚拟键键盘透明度
- error: no such file or directory