【UVa】11389 - The Bus Driver Problem
来源:互联网 发布:二木花花男 淘宝 编辑:程序博客网 时间:2024/05/22 09:04
Problem here
Problem
In a city there are n bus drivers. Also there are n morning bus routes and n afternoon bus routes with
various lengths. Each driver is assigned one morning route and one evening route. For any driver, if
his total route length for a day exceeds d, he has to be paid overtime for every hour after the first d
hours at a flat r taka / hour. Your task is to assign one morning route and one evening route to each
bus driver so that the total overtime amount that the authority has to pay is minimized.
INPUT
The first line of each test case has three integers n, d and r, as described above. In the second line,
there are n space separated integers which are the lengths of the morning routes given in meters.
Similarly the third line has n space separated integers denoting the evening route lengths. The lengths
are positive integers less than or equal to 10000. The end of input is denoted by a case with three 0’s.
OUTPUT
For each test case, print the minimum possible overtime amount that the authority must pay.
Constraints
• 1 ≤ n ≤ 100
• 1 ≤ d ≤ 10000
• 1 ≤ r ≤ 5
Sample
input
2 20 5
10 15
10 15
2 20 5
10 10
10 10
0 0 0
output
50
0
Solution
Sorting
#include <iostream>#include <vector>#include <algorithm>using namespace std;bool cmp1(int &a, int &b){ return a < b;}bool cmp2(int &a, int &b){ return a > b;}int main(){ int n, d, r; while(cin >> n >> d >> r){ if(n == 0 && d == 0 && r== 0) break; vector<int> m, e; for(int i = 0; i < n; i++){ int tm; cin >> tm ; m.push_back(tm); } for(int i = 0; i < n; i++){ int te; cin >> te; e.push_back(te); } sort(m.begin(), m.end(), cmp1); sort(e.begin(), e.end(), cmp2); int ot = 0; for(int i = 0 ;i < n; ++i){ int men = m[i] + e[i]; if(men > d){ ot += (men-d) * r; } } cout << ot << endl; } return 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(贪心)
- 14. Longest Common Prefix
- C++作业3
- Java--各种有趣的图案输出
- 【3】mysql字段类型
- MR程序的几种提交运行模式
- 【UVa】11389 - The Bus Driver Problem
- Retrofit2初尝问题汇总及解决方案(含Dagger2)
- 初学Qt——vs2012开发环境下的窗体跳转
- hihocoder 1032 : 最长回文子串(Manacher)
- 字和字节的区别&&&&如何精确表示pi
- 已解决的问题-----Cocos交叉编译不能通过!
- nginx
- 怎样进入 Windows 10 的“开发者模式”
- apicloud如何实现优雅的下拉刷新与加载更多(Appcan也可类似实现)