CodeForces 363D.Renting Bikes(二分+贪心)

D. Renting Bikes

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.

The renting site offered them m bikes. The renting price is different for different bikes, renting the j-th bike costs pj rubles.

In total, the boys' shared budget is a rubles. Besides, each of them has his own personal money, the i-th boy has bi personal rubles. The shared budget can be spent on any schoolchildren arbitrarily, but each boy's personal money can be spent on renting only this boy's bike.

Each boy can rent at most one bike, one cannot give his bike to somebody else.

What maximum number of schoolboys will be able to ride bikes? What minimum sum of personal money will they have to spend in total to let as many schoolchildren ride bikes as possible?

Input

The first line of the input contains three integers n, m and a (1 ≤ n, m ≤ 105; 0 ≤ a ≤ 109). The second line contains the sequence of integers b1, b2, ..., bn (1 ≤ bi ≤ 104), where bi is the amount of the i-th boy's personal money. The third line contains the sequence of integers p1, p2, ..., pm (1 ≤ pj ≤ 109), where pj is the price for renting the j-th bike.

Output

Print two integers r and s, where r is the maximum number of schoolboys that can rent a bike and s is the minimum total personal money needed to rent r bikes. If the schoolchildren cannot rent any bikes, then r = s = 0.

Examples

input

2 2 10
5 5
7 6

output

2 3

input

4 5 2
8 1 1 2
6 3 7 5 2

output

3 8

Note

In the first sample both schoolchildren can rent a bike. For instance, they can split the shared budget in half (5 rubles each). In this case one of them will have to pay 1 ruble from the personal money and the other one will have to pay 2 rubles from the personal money. In total, they spend 3 rubles of their personal money. This way of distribution of money minimizes the amount of spent personal money.

题意：一堆人租自行车，有共有的资金和私人资金。私人资金只能给自己用，共有资金可以通用。列出n个人的钱，然后列出m辆车的租费，求最大租车数以及个人最少花的钱 。

分析：

如果对题目的要求答案设个优先级，那么毫无疑问，租最多的自行车优先级最高，个人花的钱最少次之。

那么首先去满足优先级最高的事件——租更多的 车。怎么个租法呢？肯定是钱多的人去租最贵的车。其实题目中，有可能不是所有人都能租到车，所以有可能会选择的是钱较多的几个人去租最便宜的几辆车。我们可以二分租到的车的数量，然后去判断能不能租到这么多车。

另外，在二分判断完能租到车的最大数量后，要使个人所花的钱最少，也就是公款花的最多。那么我们可以先用公款贿赂租车商，让租车的价格先降下来，那么自己所花的租车的钱自然也就少了。

AC代码：

#include<bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int b[maxn], p[maxn];

int main()
{
    int n, m, a;
    while(cin >> n >> m >> a)
    {
        for(int i = 1; i <= n; i++)
            cin >> b[i];
        for(int i = 1; i <= m; i++)
            cin >> p[i];
        sort(b+1, b+n+1);
        sort(p+1, p+m+1);
        int left = 0, right = min(n, m), mid, sum = 0, tol, leap;
        while(left <= right)
        {
            leap = 0;
            tol = a;
            mid = (left + right) / 2;
            for(int i = 1; i <= mid; i++)
            {
                if(b[n-mid+i] >= p[i])
                    continue;
                else if(b[n-mid+i] + tol >= p[i])
                    tol -= (p[i] - b[n-mid+i]);
                else
                {
                    leap = 1;
                    break;
                }
            }
            if(leap)
                right = mid - 1;
            else
            {
                sum = mid;
                left = mid + 1;
            }
        }
        int ans = -a;
        for(int i = 1; i <= sum; i++)
            ans += p[i];
        cout << sum << " " << max(0, ans) << endl;
    }
    return 0;
}