UVA 11729 Commando War
2015-08-03 08:46
375 查看
#include <iostream> #include <cstdio> #include <cstring> #include <cmath> #include <algorithm> using namespace std; struct Job { int b, j; }job[1010]; bool cmp(Job a, Job b) { if(a.j > b.j) return 1; else return 0; } int kase = 1; int main() { int n; while(scanf("%d", &n) != EOF && n) { int a = 0, b = 0, sum = 0, maxi; for(int i=0; i<n; i++) { scanf("%d%d", &job[i].b, &job[i].j); } sort(job, job+n, cmp); sum = job[0].b; maxi = job[0].b +job[0].j; for(int i=1; i<n; i++) { sum += job[i].b; if((sum + job[i].j) > maxi) maxi = sum + job[i].j; } printf("Case %d: %d\n", kase, maxi); kase ++; } return 0; }
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 |
【思路】
使用结构体储存。根据完成任务时间排序,将完成时间长的工作先交代。同时将总时间进行比较,选取总时间最长的。
相关文章推荐
- Android Studio使用技巧系列教程(六)
- linux awk使用例子
- Android根据联系人姓名首字符顺序读取通讯录
- ERP需求调研之仓库物料管理十问十答
- p1475
- CANVAS绘制多边形
- VS 编写c++dll库文件
- Android Studio使用技巧系列教程(四)
- 杭电 1864 最大报销额 附WA原因
- 【转】jvm虚拟机参数详解之-jar参数运行时报ClassNotFound
- 第三周第四天(【客户端服务器通信】【网络连接InetAddress类】)
- CANVAS绘制仪表盘
- Android Studio使用技巧系列教程(二)
- Android Studio使用技巧系列教程(三)
- CANVAS绘制圆弧
- 多个Controller之间的跳转
- Android Studio使用技巧系列教程(一)
- AMP(Apache+Mysql+PHP)的安装与配置
- linux c 笔记 线程控制(三)
- linux c 笔记 线程控制(二)