洛谷P2983 [USACO10FEB]购买巧克力Chocolate Buying

最新推荐文章于 2023-12-04 06:00:42 发布

-斯德哥尔摩-

最新推荐文章于 2023-12-04 06:00:42 发布

阅读量314

点赞数

分类专栏：贪心

本文为博主原创文章，未经博主允许不得转载。

本文链接：https://blog.csdn.net/yangrui2002/article/details/78573157

版权

贪心专栏收录该内容

11 篇文章 0 订阅

订阅专栏

题目描述

Bessie and the herd love chocolate so Farmer John is buying them some.

The Bovine Chocolate Store features N (1 <= N <= 100,000) kinds of chocolate in essentially unlimited quantities. Each type i of chocolate has price P_i (1 <= P_i <= 10^18) per piece and there are C_i (1 <= C_i <= 10^18) cows that want that type of chocolate.

Farmer John has a budget of B (1 <= B <= 10^18) that he can spend on chocolates for the cows. What is the maximum number of cows that he can satisfy? All cows only want one type of chocolate, and will be satisfied only by that type.

Consider an example where FJ has 50 to spend on 5 different types of chocolate. A total of eleven cows have various chocolate preferences:

Chocolate_Type Per_Chocolate_Cost Cows_preferring_this_type 1 5 3

2 1 1

3 10 4

4 7 2

5 60 1

Obviously, FJ can't purchase chocolate type 5, since he doesn't have enough money. Even if it cost only 50, it's a counterproductive purchase since only one cow would be satisfied.

Looking at the chocolates start at the less expensive ones, he can purchase 1 chocolate of type #2 for 1 x 1 leaving 50- 1=49, then purchase 3 chocolate of type #1 for 3 x 5 leaving 49-15=34, then purchase 2 chocolate of type #4 for 2 x 7 leaving 34-14=20, then purchase 2 chocolate of type #3 for 2 x 10 leaving 20-20= 0.

He would thus satisfy 1 + 3 + 2 + 2 = 8 cows.

贝西和其他奶牛们都喜欢巧克力，所以约翰准备买一些送给她们。奶牛巧克力专卖店里

有N种巧克力，每种巧克力的数量都是无限多的。每头奶牛只喜欢一种巧克力，调查显示，

有Ci头奶牛喜欢第i种巧克力，这种巧克力的售价是P。

约翰手上有B元预算，怎样用这些钱让尽量多的奶牛高兴呢？

输入输出格式

输入格式：

Line 1: Two space separated integers: N and B
Lines 2..N+1: Line i contains two space separated integers defining chocolate type i: P_i and C_i

输出格式：

Line 1: A single integer that is the maximum number of cows that Farmer John can satisfy

输入输出样例

输入样例#1：

输出样例#1：

贪心大法。。。

结构体+快排秒过。。。

记得开 unsigned long long 。。。

附代码：

#include<iostream>
#include<algorithm>
#include<cstdio>
#define MAXN 100010
using namespace std;
unsigned long long n,m,ans=0;
struct node{
	unsigned long long p,c;
}a[MAXN];
inline unsigned long long read(){
	unsigned long long date=0,w=1;char c=0;
	while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
	while(c>='0'&&c<='9'){date=date*10+c-'0';c=getchar();}
	return date*w;
}
bool cmp(const node &x,const node &y){
	if(x.p==y.p)return x.c>y.c;
	return x.p<y.p;
}
int main(){
	n=read();m=read();
	for(int i=1;i<=n;i++){a[i].p=read();a[i].c=read();}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++){
		if(m>=a[i].p*a[i].c){
			m-=a[i].p*a[i].c;
			ans+=a[i].c;
		}
		else{
			ans+=m/a[i].p;
			m-=(m/a[i].p*a[i].p);
		}
	}
	printf("%llu\n",ans);
	return 0;
}