UVa Commando War-11729(排序+贪心)
来源:互联网 发布:矩阵的零次幂 编辑:程序博客网 时间:2024/06/08 17:46
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
//思路:贪心选择j大的先执行(j相同也没关系)
AC源码:
#include <iostream>#include <vector>#include <algorithm>#include <cstdio>using namespace std;struct Job{int b,j;bool operator<(const Job& rhs)const{return j>rhs.j;}};int main(){int n,b,j,kase=1;while(scanf("%d",&n)&&n){vector<Job> vec;for(int i=0;i<n;++i){scanf("%d %d",&b,&j);vec.push_back((Job){b,j});}sort(vec.begin(),vec.begin()+n);int t=0;int ans=0;for(int i=0;i<n;++i){t+=vec[i].b;ans=max(ans,t+vec[i].j);}printf("Case %d: %d\n",kase++,ans);}return 0;}
- UVA 11729 Commando War(排序+贪心)
- UVA-11729 - Commando War(贪心、排序)
- UVa - 11729 - Commando War ( 排序+贪心 )
- UVa Commando War-11729(排序+贪心)
- 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 贪心
- Struts类型转换器
- 农业物联网的道路上,还有个联想的身影
- php单例模式
- 《CPP入门基础知识》
- 快速排序
- UVa Commando War-11729(排序+贪心)
- hadoop背景介绍及在大数据、云计算中的位置和关系
- 基于Qt的ARM-Linux系统测试工具
- FreeMarker与JSP 2.0 + JSTL组合进行比较
- 连接池之DBCP
- FastDFS connect timed out 报错解决方法亲试
- OAuth 2.0 认证的原理与实践
- Maven-EclipseEE使用Maven构建Java web项目从0到1
- linux之so文件、a文件、o文件的区别