Sicily 1093. Air Express

最新推荐文章于 2017-02-20 19:57:30 发布

一头迟钝的猪

最新推荐文章于 2017-02-20 19:57:30 发布

阅读量310

点赞数

CC 4.0 BY-SA版权

分类专栏：算法文章标签： sicily

本文链接：https://blog.youkuaiyun.com/luqinwei/article/details/44855951

算法专栏收录该内容

81 篇文章

订阅专栏

本文介绍了一个基于不同重量段的定价策略程序。通过输入不同重量区间的价格参数和一系列具体物品的重量，程序能够计算并输出每个物品的最佳购买价格及是否需要添加额外重量来获取更优惠的价格。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream>

using namespace std;

int arr[1000000];

int main(){
	int n1,p1,n2,p2,n3,p3,p4,k=1;
	while(cin >> n1){
		cin >> p1 >> n2 >> p2 >> n3 >> p3 >> p4;
		int n=0;
		while(true){
			cin >> arr[n];
			if(arr[n]==0)break;
			else n++;
		}
		cout << "Set number " << k << ":" << endl;
		k++;
		for(int i=0; i < n; ++i){
			int price1=0,price2=0;
			if(arr[i] <= n1 && arr[i]>= 0){
				price1=arr[i]*p1;
				price2=(n1+1)*p2;
				if(price1 <= price2) cout << "Weight (" << arr[i] << ") has best price $" << price1 <<  " (add 0 pounds)" << endl;
				else cout << "Weight (" << arr[i] << ") has best price $" << price2 <<  " (add " << n1+1-arr[i] << " pounds)" << endl;
			}
			else if(arr[i] <= n2 && arr[i]>= n1+1){
				price1=arr[i]*p2;
				price2=(n2+1)*p3;
				if(price1 <= price2) cout << "Weight (" << arr[i] << ") has best price $" << price1 <<  " (add 0 pounds)" << endl;
				else cout << "Weight (" << arr[i] << ") has best price $" << price2 <<  " (add " << n2+1-arr[i] << " pounds)" << endl;
			}
			else if(arr[i] <=n3 && arr[i] >= n2+1){
				price1=arr[i]*p3;
				price2=(n3+1)*p4;
				if(price1 <= price2) cout << "Weight (" << arr[i] << ") has best price $" << price1 <<  " (add 0 pounds)" << endl;
				else cout << "Weight (" << arr[i] << ") has best price $" << price2 <<  " (add " << n3+1-arr[i] << " pounds)" << endl;
			}
			else if(arr[i] >= n3+1) cout << "Weight (" << arr[i] << ") has best price $" << p4*arr[i] <<  " (add 0 pounds)" << endl;
		}
		cout << endl;
	}
}