[UVa] 11389 The Bus Driver Problem.cpp

#include <cstdio>
#include <algorithm>
int main()
{
    int n, d, r;
    int morning[105], night[105];
    while (scanf("%d %d %d", &n, &d, &r) && (n || d || r)) {
        for (int i = 0; i < n; ++i) scanf("%d", &morning[i]);
        for (int i = 0; i < n; ++i) scanf("%d", &night[i]);

        std::sort(morning, morning + n);
        std::sort(night, night + n);

        int fine = 0;
        for (int i = 0; i < n; ++i)
            if (morning[i] + night[n-i-1] > d)
                fine += ((morning[i] + night[n-i-1] - d) * r);
        printf("%d\n", fine);
    }
}