pat 1070Mooncake (25)
来源:互联网 发布:ubuntu 设置默认路径 编辑:程序博客网 时间:2024/05/17 01:51
#include<iostream>
#include<algorithm>
#include<iomanip>
using namespace std;
struct moon
{
double amounts;
double price;
double value;
}mooncake[1005];
bool cmp(const struct moon &a,const struct moon &b)//注意这里的写法
{
return a.value>b.value;
}
int main()
{
int n,demands;
int i,k;
double profit;
cin>>n>>demands;
for(i=1;i<=n;i++)
{
cin>>mooncake[i].amounts;
}
for(i=1;i<=n;i++)
{
cin>>mooncake[i].price;
mooncake[i].value=mooncake[i].price/mooncake[i].amounts;
}
sort(mooncake+1,mooncake+n+1,cmp);
profit=0.0;
for(i=1;i<=n;i++)
{
if(demands<=0)break;
if(demands>mooncake[i].amounts)
{
profit+=mooncake[i].price;
demands-=mooncake[i].amounts;
}
else
{
profit+=demands*mooncake[i].value;
demands-=demands;
}
}
cout<<fixed<<setprecision(2)<<profit<<endl;
system("pause");
return 0;
}
#include<algorithm>
#include<iomanip>
using namespace std;
struct moon
{
double amounts;
double price;
double value;
}mooncake[1005];
bool cmp(const struct moon &a,const struct moon &b)//注意这里的写法
{
return a.value>b.value;
}
int main()
{
int n,demands;
int i,k;
double profit;
cin>>n>>demands;
for(i=1;i<=n;i++)
{
cin>>mooncake[i].amounts;
}
for(i=1;i<=n;i++)
{
cin>>mooncake[i].price;
mooncake[i].value=mooncake[i].price/mooncake[i].amounts;
}
sort(mooncake+1,mooncake+n+1,cmp);
profit=0.0;
for(i=1;i<=n;i++)
{
if(demands<=0)break;
if(demands>mooncake[i].amounts)
{
profit+=mooncake[i].price;
demands-=mooncake[i].amounts;
}
else
{
profit+=demands*mooncake[i].value;
demands-=demands;
}
}
cout<<fixed<<setprecision(2)<<profit<<endl;
system("pause");
return 0;
}
0 0
- pat 1070Mooncake (25)
- PAT (Advanced Level) Practise 1070 Mooncake (25)
- PAT (Advanced Level) Practise 1070 Mooncake (25)
- PAT 1070 Mooncake
- 【PAT】1070. Mooncake (25)
- PAT 1070. Mooncake (25)
- PAT 1070. Mooncake (25)
- PAT 1070. Mooncake (25)
- pat 1070. Mooncake (25)
- PAT 1070. Mooncake (25)
- PAT-Mooncake (25)
- PAT 1070. Mooncake (25)
- pat-a1070. Mooncake (25)
- PAT (Advanced) 1070. Mooncake (25)
- PAT A 1070. Mooncake (25)
- ZJU-PAT 1070. Mooncake (25)
- PAT(A) - 1070. Mooncake (25)
- PAT甲级1070. Mooncake (25)
- 学生类2
- Ubantu12.04设置无线上网及静态地址
- libmad学习进阶2----利用libmad将mp3转码成pcm
- Android4.2蓝牙基础架构学习
- java 23 种设计模式
- pat 1070Mooncake (25)
- Android笔记 动画之tween(补间)动画demo
- IOS 实现录音PCM转MP3格式(边录音边转码)
- 王立平--图片加密
- 利用crsctl生产resource脚本,并生成新的资源
- 圆形进度条
- Gridview中的数据导出到excel中
- 条件编译
- Leetcode:Largest Rectangle in Histogram与Maximal Rectangle