纪中训练5月6日提高组T2

【USACO 2018 January Silver】Problem 2. Rental Service

传送门
想法
贪心
一堆的贪心

贪心.1：按牛的产奶量贪心
贪心.2：按买牛奶的钱贪心
贪心.3：按租奶牛的钱贪心

详细的看代码理解：

#include<bits/stdc++.h>
using namespace std;
struct node
{
	long long need,money;
}b[100005];
int i;
long long n,m,k,t,sum,take,ans;
long long a[100005],c[100005];
bool cmp1(long long x,long long y)
{
	return x>y;
}
bool cmp2(node x,node y)
{
	return x.money>y.money;
}
int main()
{
	freopen("rental.in","r",stdin);
	freopen("rental.out","w",stdout);
	scanf("%lld%lld%lld",&n,&m,&k);
	for (i=1;i<=n;i++)
		scanf("%lld",&a[i]);
	sort(a+1,a+1+n,cmp1);
	for (i=1;i<=m;i++)
		scanf("%lld%lld",&b[i].need,&b[i].money);
	sort(b+1,b+1+m,cmp2);
	for (i=1;i<=k;i++)
		scanf("%lld",&c[i]);
	sort(c+1,c+1+k,cmp1);
	for (i=1;i<=k;i++)
		c[i]+=c[i-1];
	t=1;
	for (i=0;i<=n;i++)
	{
		sum+=a[i];
		while (t<=m&&sum>=b[t].need)
		{
			take=take+b[t].need*b[t].money;
			sum-=b[t].need;
			t++;
		}
		if (t<=m)
		{
			take+=sum*b[t].money;
			b[t].need-=sum;
			sum=0; 
		}
		ans=max(ans,take+c[min(n-i,k)]);
	} 
	printf("%lld\n",ans);
	fclose(stdin);
	fclose(stdout);
	return 0;	
}