题 E: FatMouse's Trade

题目描述

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.

 

输入

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.

 

输出

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.

 

样例输入

4 2
4 7
1 3
5 5
4 8
3 8
1 2
2 5
2 4
-1 -1

样例输出

2.286
2.500

 

#include <stdio.h>
#include <algorithm>
using namespace std;
struct warehouse{
	int  bean,catfood;
	double percent;
}ware[1001];
bool cmp(warehouse a,warehouse b){
	return a.percent >b.percent ;
}
int main(){
	int i,m,n;
	while(scanf("%d%d",&m,&n)) {
		if(m==-1&&n==-1)	break;
		for(i=0;i<n;i++){
			scanf("%d%d",&ware[i].bean ,&ware[i].catfood );
			ware[i].percent =1.0*ware[i].bean/ware[i].catfood;
		}
		sort(ware,ware+n,cmp);
		double obtain=0;
		for(i=0;m;i++){
			if(ware[i].catfood <m){
				obtain+=ware[i].bean ;
				m-=ware[i].catfood ;
			}
			else{
				obtain+=1.0*m/ware[i].catfood *ware[i].bean ;
				m=0;
			}
		}
		printf("%.3f\n",obtain);
	}
	return 0;
}