题目链接:
https://pintia.cn/problem-sets/994805260223102976/problems/994805301562163200
思路:这种题是典型的贪心算法类的题目,要求收益最大,那么我们就先算出性价比最高的商品(即每斤最贵),再将其排序,性价比最高的商品卖完了,再卖第二高的,这样就保证了赚的钱最多。
填坑日记:没错!!!这题居然有坑。。。。。哇我第一次提交的时候,测试点3过不了,其他都对了,问题是,测试点3是段错误,我百思不得其解为啥会出错,后面想了半天,发现我考虑的条件全是基于库存大于需求的,其实这道题要分成两个部分来考虑:
1.库存小于需求(这个时候就可以直接将所有的钱加起来再输入就行)
2.库存大于需求(此时就要用到我们的贪心思想啦)
代码:
#include<iostream>
#include<algorithm>
using namespace std;
struct mooncake
{
float ku;
float money;
float average;
}cake[2000];
float cmp(struct mooncake a,struct mooncake b)
{
return a.average>=b.average;
}
int main()
{
int N,D,D1,i=0,sold=0,all=0;
float income=0,allmoney=0;
cin>>N>>D;
D1=D;
for(i=0;i<N;i++)
{
cin>>cake[i].ku;
all+=cake[i].ku;
}
for(i=0;i<N;i++)
{
cin>>cake[i].money;
allmoney+=cake[i].money;
cake[i].average=cake[i].money/cake[i].ku;
}
sort(cake,cake+N,cmp);
i=0;
if(all<=D)
printf("%.2f",allmoney);
else
{
while(sold!=D)
{
if(cake[i].ku<D1)
{
sold=sold+cake[i].ku;
income=income+cake[i].money;
D1=D1-cake[i].ku;
}
else
{
sold=sold+D1;
income+=D1*cake[i].average;
}
i++;
}
printf("%.2f",income);
}
return 0;
}
好了亲爱的胖友们,又到了一天一度的欣赏大佬代码的时光了,链接在此:https://www.liuchuo.net/archives/543
代码如下:
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
struct mooncake{
float mount, price, unit;
};
int cmp(mooncake a, mooncake b) {
return a.unit > b.unit;
}
int main() {
int n, need;
cin >> n >> need;
vector<mooncake> a(n);
for (int i = 0; i < n; i++) scanf("%f", &a[i].mount);
for (int i = 0; i < n; i++) scanf("%f", &a[i].price);
for (int i = 0; i < n; i++) a[i].unit = a[i].price / a[i].mount;
sort(a.begin(), a.end(), cmp);
float result = 0.0;
for (int i = 0; i < n; i++) {
if (a[i].mount <= need) {
result = result + a[i].price;
} else {
result = result + a[i].unit * need;
break;
}
need = need - a[i].mount;
}
printf("%.2f",result);
return 0;
}
大佬又暴击了我一次,唔。。。其实直接可以用for语句约束循环次数啊。。。。即使需求大于库存,循环完了也满足了条件呀,完美度过测试点3啧啧,大佬的代码还是一如既往的短小精悍有内涵233333333.