UVA - 11389 The Bus Driver Problem
来源:互联网 发布:关于高中数学的软件 编辑:程序博客网 时间:2024/05/24 06:49
题目大意:有 n 个司机,n 条下午路线和n条晚上路线,先在要给每个司机安排一条下午路线和一条晚上路线,如果司机的工作时间超过 d,则要按照每小时 r 元增加加班费,问最少需支付多少加班费。
解题思路:贪心,下午最大的搭配晚上最小的,一次类推。
#include <cstdio>#include <algorithm>using namespace std;int main() { int n, d, r; while (scanf("%d%d%d", &n, &d, &r) && n + d + r) { int M[110], E[110]; for (int i = 0; i < n; i++) scanf("%d", &M[i]); for (int i = 0; i < n; i++) scanf("%d", &E[i]); sort(M, M + n); sort(E, E + n); int ans = 0; for (int i = 0; i < n; i++) if (M[i] + E[n-i-1] > d) ans += (M[i] + E[n-i-1] - d) * r; printf("%d\n", ans); } return 0;}
0 0
- Uva Oj 11389 - The Bus Driver Problem
- Uva-11389-The Bus Driver Problem
- uva 11389 The Bus Driver Problem
- UVA - 11389 The Bus Driver Problem
- UVA 11389 - The Bus Driver Problem (贪心)
- UVA 11389 - The Bus Driver Problem
- UVa 11389 - The Bus Driver Problem
- UVA - 11389 The Bus Driver Problem 贪心
- UVA - 11389 The Bus Driver Problem
- 【UVa】11389 - The Bus Driver Problem
- UVa 11389 The Bus Driver Problem
- UVA - 11389 The Bus Driver Problem
- UVA 11389 The Bus Driver Problem(贪心)
- UVA 11389 The Bus Driver Problem .
- UVa 11389 The Bus Driver Problem
- UVA 11389 The Bus Driver Problem(贪心)
- UVA 11389——The Bus Driver Problem
- uva 11389 - The Bus Driver Problem(贪心)
- TinyXml使用实例
- params.put和params.add的区别
- 程序练习
- Android特效3
- Win7下安装与配置PHP环境(三)
- UVA - 11389 The Bus Driver Problem
- 如何打造一个社区O2O综合平台
- PushMeBaby 使用
- C++链表冒泡,归并,插入排序(纯指针)
- 一些有趣的个人收集[不定时更新]
- 无线互联北京培训基地第49期学员李天游
- Wireshark数据抓包教程之认识捕获分析数据包
- Android中如何实现ListView的分页加载
- ZBAR 二维码扫描