1.3.1_HDOJ_FatMouse'Trade_has n rooms. the i-th room contains j[i] pounds of-CSDN博客

本文链接：https://blog.csdn.net/qq_20141243/article/details/51058713

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

解题思路：

原理是利用了贪心算法的思想

J[i]是要得到的价值，F[i]是需要付出的代价，利用J[i]/F[i]，优先取比值大的。

首先要对比值进行排序，在C/C++中用qsort()函数；函数怎么用链接如下：

http://blog.csdn.net/qq_20141243/article/details/51058987点击打开链接

#include "stdio.h"
#include "stdlib.h"
const int MAXN=1000;
struct node{
	double j,f;
	double r;
}a[MAXN];

int cmp(const void * a,const void * b){
	struct node *c=(node *)a;
	struct node *d=(node *)b;
	if(c->r>d->r) 
		return -1;
	else
		return 1;
}

int main(){
	int N;
	double M;
	double ans;
	while(scanf("%lf%d",&M,&N)){
		if(M==-1&&N==-1) break;
		for(int i=0;i<N;i++){
			scanf("%lf%lf",&a[i].j,&a[i].f);
			a[i].r=(double)a[i].j/a[i].f;
		}
		qsort(a,N,sizeof(a[0]),cmp);
		ans=0;
		for(int i=0;i<N;i++){
	
				if(M>a[i].f){
					ans+=a[i].j;
					M-=a[i].f;
				}
				else{
					ans+=(a[i].j/a[i].f)*M;
					break;
				}
    	}
    	printf("%.3lf\n",ans);
	}
	return 0;
}

有什么问题或者建议一定要评论哈~！~~~