UVA - 11389-day9H

问题来源

UVA - 11389

问题描述

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.

输入

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.

输出

For each test case, print the minimum possible overtime amount that the authority must pay.

例子

input

2 20 5
10 15
10 15
2 20 5
10 10
10 10
0 0 0

output

50
0

解题思路

贪心算法，每一个司机给他安排一条晚上最短，白天最长，或者晚上最长，白天最短的线路就行，平衡司机的时间，尽量让他们满载工作，把多出来的计算一下就行了。

AC的代码

#include<string>
#include <iostream>
using namespace std;
int aa[105],bb[105];

int main()
{
	int n, d, r;
	while (cin >> n >> d >> r&&(n+d+r)) 
	{
		for (int g = 0; g < n; g++)
			cin >> aa[g];
		for (int g = 0; g < n; g++)
			cin >> bb[g];
		for (int f = 0; f < n - 1; f++)
		{
			for (int e = f + 1; e < n; e++)
			{
				if (aa[f] < aa[e])
				{
					int temp = aa[f];
					aa[f] = aa[e];
					aa[e] = temp;
				}
				if (bb[f] > bb[e])
				{
					int temp1 = bb[f];
					bb[f] = bb[e];
					bb[e] = temp1;
				}
			}
		}
		int sum = 0;
		for (int o = 0; o < n; o++)
		{
			if (aa[o] + bb[o] > d)
				sum += (aa[o] + bb[o] - d)*r;
		}
		cout << sum << endl;

	}
}