渣渣ACM日记——1009-FatMouse' Trade (HDOJ)

FatMouse' Trade

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

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
  
  
  
  


  
  
  
  

   
   //简单的题目 复习一下结构体排序
  
  
  
  

   
   
#include <iostream>
#include <iomanip>
#include <algorithm>
using namespace std;
struct Node{
	int j,f;
	double hehe;
};
bool operator <(Node a,Node b){
		return a.hehe>b.hehe;
	}
int main(){
	int m,n,i;
	Node node[1005];
	while(cin>>m>>n){
		if(m==-1&&n==-1)
		break;
		double result=0;
		for(i=0;i<n;i++){
			cin>>node[i].j>>node[i].f;
			node[i].hehe=(double)node[i].j/node[i].f;
		}
		sort(node,node+n);
	/*	for(i=0;i<n;i++){
			cout<<node[i].j<<" "<<node[i].f<<" "<<	node[i].hehe<<endl;
		}*/
		for(i=0;i<n&&m>0;i++){
			if(m>node[i].f){
					m-=node[i].f;
					result+=node[i].j;
			}
			else{
				while(m>0){
					m-=1;
					result+=node[i].hehe;
				}
			}		
		}
		cout<<fixed<<setprecision(3)<<result<<endl;
	}
	return 0;
}
   
   

    
    

   
   
   
   

    
    //另一种比较函数写法
   
   
#include <iostream>
   
   
#include <iomanip>
   
   
#include <algorithm>
   
   
using namespace std;
   
   
struct Node{
   
   

   
   	int j,f;
   
   

   
   	double hehe;
   
   
};
   
   	
   
   
bool cmp(Node a,Node b){
   
   

   
   		return a.hehe>b.hehe;
   
   
}
   
   
int main(){
   
   

   
   	int m,n,i;
   
   

   
   	Node node[1005];
   
   

   
   	while(cin>>m>>n){
   
   

   
   		if(m==-1&&n==-1)
   
   

   
   		break;
   
   

   
   		double result=0;
   
   

   
   		for(i=0;i<n;i++){
   
   

   
   			cin>>node[i].j>>node[i].f;
   
   

   
   			node[i].hehe=(double)node[i].j/node[i].f;
   
   

   
   		}
   
   

   
   		sort(node,node+n,cmp);
   
   

   
   	/*
   
   	for(i=0;i<n;i++){
   
   

   
   			cout<<node[i].j<<" "<<node[i].f<<" "<<
   
   	node[i].hehe<<endl;
   
   

   
   		}*/
   
   

   
   		for(i=0;i<n&&m>0;i++){
   
   

   
   			if(m>node[i].f){
   
   

   
   					m-=node[i].f;
   
   

   
   					result+=node[i].j;
   
   

   
   			}
   
   

   
   			else{
   
   

   
   				while(m>0){
   
   

   
   					m-=1;
   
   

   
   					result+=node[i].hehe;
   
   

   
   				}
   
   

   
   			}
   
   		
   
   

   
   		}
   
   

   
   		cout<<fixed<<setprecision(3)<<result<<endl;
   
   

   
   	}
   
   

   
   	return 0;
   
   
}