贪心问题
来源:互联网 发布:域名被微信封了怎么办 编辑:程序博客网 时间:2024/03/29 10:33
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 needsJ 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<algorithm> using namespace std; struct node { int b,j; }solider[1007]; int cmp(const node a,const node b) { return a.j>b.j; } int main() { int n,kase=1; while(scanf("%d",&n),n) { int i,j; for(i=0;i<n;i++) scanf("%d%d",&solider[i].b,&solider[i].j); sort(solider,solider+n,cmp); int ans=0,s=0; for(i=0;i<n;i++) { s+=solider[i].b; ans=max(ans,s+solider[i].j); } printf("Case %d: %d\n",kase++,ans); } return 0; }
你要交代你n个部下每人一项任务,交代第i个部下的交代时间是Bi分钟,他的执行时间是Ji分钟,不能同时交代两项任务。要求你有选择交代任务的顺序,求所有任务最快完成的时间。
将J从小到大排序,然后依次执行。
- 贪心问题
- 贪心问题
- 贪心问题
- 贪心问题
- 贪心问题--过河问题
- 【贪心DP】过河问题
- 贪心--会场安排问题
- 背包问题--贪心
- 贪心算法 - 背包问题
- 【贪心】删数问题
- 【贪心】活动安排问题
- 【贪心】删数问题
- 箱子问题(贪心)
- 贪心背包问题
- 贪心法-背包问题
- 区间选点问题【贪心】
- 区间覆盖问题【贪心】
- 正统贪心问题!!!!
- 关于codeforces比赛规则介绍(转载)
- Qt模块化笔记之network——写第一个Tcp程序(1)
- 简易的学生管理系统
- 在eclipse中搭建android开发平台
- oracle定时备份-增量备份
- 贪心问题
- Android获取视屏的缩略视图和图片的缩略视图
- 实现类似小米手机的秒表指针旋转动画摸索
- 《小情绪》
- 数据结构---设计一个栈,push, pop, min 时间复杂度都是 O(1)
- 最受欢迎的开源项目
- 数据库开发(13)恢复系统
- android开发中ListView的妙用之:下拉刷新与到底部载入更多源码
- 数据库中模式的意义