贪心问题,只需要找单价最大的,然后排序,按从大到小,取种类,得结果
对于小数的处理出现问题
这里的变量都需要用double
//L2-003月饼
#include<iostream>
#include <iomanip>
using namespace std;
double kindnum[1000][2]; //存量 和 售价
double perval[1000]; //每种单价
int sortnum[1000];
int main()
{
double num, neednum, total = 1.00;
int i = 0, j = 0;
cin >> num >> neednum;
for (i = 0; i < num; i++)
{
cin >> kindnum[i][0];
}
for (i = 0; i < num; i++)
{
cin >> kindnum[i][1];
}
for (i = 0; i < num; i++)
{
perval[i] = kindnum[i][1] * 1.0 / kindnum[i][0] ;
}
int rea[1000]; //记录数组
memset(rea, 0, 1000);
for (i = 0; i < 1000; i++)
{
rea[i] = i;
}
for (i =num-1; i > 0 ; i--)
{
for (j = 0; j < i ; j++)
{
if (perval[j] < perval[j + 1])
{
double tem = perval[j];
perval[j] = perval[j + 1];
perval[j + 1] = tem;
int t = rea[j];
rea[j] = rea[j + 1];
rea[j + 1] = t;
}
}
}
double x=0;
j = 0;
double ne = neednum;
while (x < ne)
{
if (neednum > kindnum[rea[j]][0])
{
neednum = neednum - kindnum[rea[j]][0];
x += kindnum[rea[j]][0];
total = total + kindnum[rea[j]][1];
}
else
{
x += neednum;
total = total + neednum * perval[j];
}
j++;
}
cout <<setprecision(2)<<total<<endl;
return 0;
}
这里出现问题的原因是
设计了一个下标
因为排序后,原来的顺序经过打乱之后,就需要记录。
但是这里可以优化成结构体。
结构体(暂时没实现)
//L2-003月饼
#include<iostream>
#include <iomanip>
using namespace std;
double kindnum[1000][2]; //存量 和 售价
double perval[1000]; //每种单价
int sortnum[1000];
int main()
{
double num=0, neednum=0, total =0;
int i = 0, j = 0;
cin >> num >> neednum;
for (i = 0; i < num; i++)
{
cin >> kindnum[i][0];
}
for (i = 0; i < num; i++)
{
cin >> kindnum[i][1];
}
for (i = 0; i < num; i++)
{
perval[i] = kindnum[i][1]/ kindnum[i][0] ;
}
int rea[1000]; //记录数组
for (i = 0; i < 1000; i++)
{
rea[i] = i;
}
for (i =0;i<num-1;i++)
{
for (j = 0; j < num-1-i ; j++)
{
if (perval[j] < perval[j + 1])
{
double tem = perval[j];
perval[j] = perval[j + 1];
perval[j + 1] = tem;
int t = rea[j];
rea[j] = rea[j + 1];
rea[j + 1] = t;
}
}
}
double x=0;
j = 0;
double ne = neednum;
while (x < ne)
{
if (neednum > kindnum[rea[j]][0])
{
neednum = neednum - kindnum[rea[j]][0];
x += kindnum[rea[j]][0];
total = total + kindnum[rea[j]][1];
}
else
{
x += neednum;
total = total + neednum * perval[j];
}
j++;
}
printf("%.2f", total);
return 0;
}
但是还是出现了段错误。
最后用结构体解决了
代码简单易读
思路更清晰
#include<stdio.h>
#include<algorithm>
using namespace std;
struct E
{
double amount;
double price;
double avg;
};
bool cmp(E a, E b)
{
return a.avg > b.avg;
}
E buf[1111];
int main()
{
int n=0, m=0, t=0, i=0;
double sum;
sum = t = 0;
scanf("%d", &n);
scanf("%d", &m);
for (i = 0; i < n; i++)
{
scanf("%lf", &buf[i].amount);
}
for (i = 0; i < n; i++)
{
scanf("%lf", &buf[i].price);
}
for (i = 0; i < n; i++)
{
buf[i].avg = buf[i].price / buf[i].amount;
}
sort(buf, buf + n, cmp); //从buf[0]到buf[n] 左闭右开
for (i = 0; i < n; i++)
{
if (buf[i].amount <= m)
{
sum += buf[i].price;
m=m-buf[i].amount;
}
else
{
sum += buf[i].avg * m;
break;
}
}
printf("%.2lf", sum);
return 0;
}
解决。