FatMouse' Trade

最新推荐文章于 2021-10-04 23:29:25 发布

Lila_老妖

最新推荐文章于 2021-10-04 23:29:25 发布

阅读量181

点赞数

分类专栏： ACM--贪心

本文链接：https://blog.csdn.net/qq_32823673/article/details/70176818

版权

ACM--贪心专栏收录该内容

3 篇文章 0 订阅

订阅专栏

FatMouse' Trade

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 75931 Accepted Submission(s): 25999

Problem Description
FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.
The warehouse has N rooms. The i-th room contains J[i] pounds of JavaBeans and requires F[i] pounds of cat food. FatMouse does not have to trade for all the JavaBeans in the room, instead, he may get J[i]* a% pounds of JavaBeans if he pays F[i]* a% pounds of cat food. Here a is a real number. Now he is assigning this homework to you: tell him the maximum amount of JavaBeans he can obtain.

Input
The input consists of multiple test cases. Each test case begins with a line containing two non-negative integers M and N. Then N lines follow, each contains two non-negative integers J[i] and F[i] respectively. The last test case is followed by two -1's. All integers are not greater than 1000.

Output
For each test case, print in a single line a real number accurate up to 3 decimal places, which is the maximum amount of JavaBeans that FatMouse can obtain.

Sample Input
5 3
7 2
4 3
5 2
20 3
25 18
24 15
15 10
-1 -1

Sample Output
13.333
31.500

Author
CHEN, Yue

Source
ZJCPC2004

老鼠准备了M磅猫食，准备拿这些猫食跟猫交换自己喜欢的食物。有N个房间，每个房间里面都有食物。你可以得到J[i]但你需要付出F[i]的猫食。要你计算你有M磅猫食可以获得最多食物的重量。

思路：贪心算法，求最优解。将J[i]/F[i]的值从大到小排列，总是先取最大的，就能保证能够得出的最大值。

#include<stdio.h>
#include<algorithm>
using namespace std;
struct bb
{
	double get,pay;
	double ave;
}w[10001];
bool comp(bb x,bb y)
{
	if(x.ave>y.ave) return true;
	return false;
}
int main()
{
	int n,m,i;
	double sum;
	while(scanf("%d %d",&m,&n))
	{
		if(m==-1&&n==-1) break;
		sum=0;
		for(i=0;i<=n-1;i++)
		{
			scanf("%lf %lf",&w[i].get,&w[i].pay);
			w[i].ave=w[i].get/w[i].pay;
		}
		sort(w,w+n,comp);
		for(i=0;i<=n-1;i++)
		{
			if(m>=w[i].pay)
			{
				sum=sum+w[i].get;
				m=m-w[i].pay;
			}
			else
			{
				sum=sum+w[i].ave*m;
				break;
			}
		}
		printf("%.3lf\n",sum);
	}
	return 0;
}