#include <stdio.h>
struct yuebing{
double zhongliang;
double jiage; //用结构体构建整体。
};
int main()
{
int n,m;
scanf("%d %d",&n,&m);
struct yuebing yb[n]; //定义结构体为一个数组 yb。
///
for(int i = 1;i <= n;i++)
{
scanf("%lf",&yb[i].zhongliang);
}
for(int i = 1;i <= n;i++) //分别输入 结构体数组里的 数。
{
scanf("%lf",&yb[i].jiage);
}
/// 以下将结构体数组内的数按单价最高到最低进行排列;
int max;
int max2;
for(int i = 1;i <= n;i++)
{
for(int j = 1;j <= n;j++)
{if(j<i){
if( (1.00*yb[i].jiage/yb[i].zhongliang) > (1.00*yb[j].jiage/yb[j].zhongliang))
{
max = yb[j].jiage;
yb[j].jiage = yb[i].jiage;
yb[i].jiage = max;
/
max2 = yb[j].zhongliang;
yb[j].zhongliang = yb[i].zhongliang;
yb[i].zhongliang = max2;
}
}
}
}
// 计算 收益sum
double sum = 0;
for(int i = 1;i <= n;i++)
{
if(m - yb[i].zhongliang >= 0)
{
sum = sum + yb[i].jiage;
m = m - yb[i].zhongliang;
}
else if(m-yb[i].zhongliang < 0)
{
sum = sum + m*(1.00*yb[i].jiage/yb[i].zhongliang);
break;
}
}
printf("%.2f",sum);
return 0;
}
7-2 月饼 (25 分)
最新推荐文章于 2024-07-14 16:16:30 发布