FatMouse’ Trade

最新推荐文章于 2021-02-23 22:53:14 发布

summm153

最新推荐文章于 2021-02-23 22:53:14 发布

阅读量92

点赞数

本文链接：https://blog.csdn.net/summm153/article/details/113789962

版权

FatMouse’ Trade

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

Sample Output

13.333
31.500

贪婪算法。

每次找出 JavaBeans比上cat food 最多的房间，然后获得该房间内最多的JavaBeans。

#include<stdio.h>
#include <malloc.h>
void recive(float* p1,float* p2,int n);
int main() {
	float m;
	int n;
	float obtain = 0;
	int i;
	scanf("%f %d",&m,&n);
	while (m != -1 && n != -1)
	{
		float* J = (float*)malloc((n * sizeof(float)));  //储存J数组 
		float* F = (float*)malloc(n * sizeof(float));    // 储存F 数组 
		float* H = (float*)malloc(n * sizeof(float));  
		recive(J, F, n);
		for ( i = 0; i <= n; i++) {                        //计算占比
			H[i] = J[i] / F[i];
		}
		while (m!=0) {
			i = 0;
			float h=0;
			for (int j = 0; j < n; j++)                //找出最大占比的位置 
				if (H[j] > h)
				{
					h = H[j];
					i = j;
				}
				H[i] = 0;                           //使用过设置为0 
			if (m > F[i])
			{
				obtain = obtain + J[i];
				m = m - F[i];
			}
			else { 
				obtain = obtain + J[i] * m/F[i];
				m = 0;
			}   
		}
		free(J);
		free(F);
		free(H);
		printf("%f\n", obtain);
		obtain = 0;
		scanf("%f %d", &m, &n);
	}
	}

void recive(float* p1,float* p2, int n) {
	for (int i = 0; i < n; i++)
	{
		scanf("%f %f", &p1[i], &p2[i]);
	}
}