P2983 [USACO10FEB] Chocolate Buying S_c++ chocolate buying-CSDN博客

本文链接：https://blog.csdn.net/m0_62597063/article/details/131668513

文章讲述了USACO竞赛中的一道题目，涉及如何在有限预算内使用贪心算法和排序策略，使最多数量的奶牛获得喜欢的巧克力。问题转化为求解在给定价格和数量的巧克力种类中，如何分配预算以满足最多的奶牛需求。

摘要由CSDN通过智能技术生成

文章目录

[USACO10FEB] Chocolate Buying S

[USACO10FEB] Chocolate Buying S

题面翻译

贝茜和其他奶牛们都喜欢巧克力，所以约翰准备买一些送给她们。奶牛巧克力专卖店里有 $N$ 种巧克力，每种巧克力的数量都是无限多的。

每头奶牛只喜欢一种巧克力，调查显示，有 $C_i$ 头奶牛喜欢第 $i$ 种巧克力，这种巧克力的售价是 $P_i$ 。

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

题目描述

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

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

Farmer John has a budget of $\le B \le 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 $\times 1$ leaving $50 - 1 = 49$ , then purchase $3$ chocolate of type $1$ for $\times 5$ leaving $49 - 15 = 34$ , then purchase $2$ chocolate of type $4$ for $\times 7$ leaving $34 - 14 = 20$ , then purchase $2$ chocolate of type $3$ for $\times 10$ leaving $20 - 20 = 0$ .

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

输入格式

Line $1$ : Two space separated integers: $N$ and $B$ .

Lines $2\ldots 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

样例输出 1

题解部分

输出输入的意思

由于这个翻译不行，所以需要看英文 $.$
第 $1$ 行：输入两个数为 $N$ 和 $B .$
第 $2... N + 1$ 行，第 $i$ 行有两个数，第一个为巧克力的售价 $P_i$ ,第二个数为喜欢第 $i$ 种巧克力的奶牛数 $C_i.$

思路

既然已经明白了意思，就开始构思了
第一眼，这不是 $d p$ 吗 $?$ 然后又想了想拉开了旁边的算法 $.$
哦，贪心 $!$ 哦，排序后贪心 $!$
既然有排序的话结构体是肯定要用的 $.$
思路
首先，对于一种巧克力，我们肯定尽可能的满足奶牛的需求 $.$
既然这样那肯定是从喜欢便宜巧克力的奶牛开始呐，于是贪心就来了 $.$
我们首先对数据进行处理，从小到大进行排序
然后对于奶牛尽可能的满足他们，当遍历到无法满足奶牛时，就是答案了，因为如果连便宜巧克力都买不了，那贵的一定也买不了 $.$

Accepted Code

于是代码就有了

#include<bits/stdc++.h>
using namespace std;
const int N=100001;
struct no{
	unsigned long long c,p;
}q[N];
unsigned long long n,b,ans;
bool px(no a,no b){
	return a.p<b.p;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin>>n>>b;
	for(unsigned long long i=1;i<=n;i++){
		cin>>q[i].p>>q[i].c;
	}
	sort(q+1,q+1+n,px);
	for(unsigned long long i=1;i<=n;i++){
		unsigned long long xx=q[i].p*q[i].c;
		if(xx<=b){
			ans+=q[i].c;//满足他们
			b-=xx;//不要忘记付钱
		}else{
			ans+=b/q[i].p;//尽可能满足
			break;
		}
	}
	cout<<ans;
	return 0;
}