Renting Bikes(二分+贪心）

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.
Example
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辆自行车，现有公款数为a，另外每个孩子私有bi元，每辆车的租金是pj。求出在租到最多辆车的情况下，私人花费的和最小是多少

思路：

对租到的车辆数二分，首先对b数组和p数组排序（升序）,判断每次能否租到mid辆

#include<stdio.h>
#include<algorithm>
using namespace std;
const int M = 1e5+5;
int p[M],b[M];
int n,m,a,all_sum,public_sum;
bool keyi(int);//函数名一时想不起来起什么好。。。
int main()
{
	scanf("%d%d%d",&n,&m,&a);
	for(int i=1;i<=n;i++)
		scanf("%d",&b[i]);
	for(int i=1;i<=m;i++)
		scanf("%d",&p[i]);
	sort(p+1,p+m+1);
	sort(b+1,b+n+1);
	int L,R,mid,temp=0;
	L=1;
	R=min(n,m);
	while(L<=R)
	{
		mid=(L+R)/2;
		if(keyi(mid))
		{
			L=mid+1;
			temp=mid;//temp记录可以租到的数量，如果可以租到更多就更新它的值
		}
		else
			R=mid-1;
	}
	all_sum=0;
	for(int i=1;i<=temp;i++)
		all_sum+=p[i];
	printf("%d ",temp);
	if(all_sum<=a)//加个判断
		printf("0");
	else
		printf("%d",all_sum-a);
	return 0;
}
bool keyi(int x)//函数的功能是判断能否租到x辆，不必考虑太多
{
	public_sum=0;
	for(int i=x;i>=1;i--)
	{
		if(b[n-x+i]<p[i])
		{
			public_sum+=p[i]-b[n-x+i];
		}
		if(public_sum>a)//公款花费大于a果断返回
			return false;
	}
	return true;
}