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

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

#include<iostream>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<cstring>
#include<vector>
#include<cmath>
using namespace std;
#define N 1005
typedef long long LL;

struct node{
double j;
double f;
}t[N];

bool cmp(node x, node y){
if((x.j / x.f) > (y.j / y.f)){
return true;
}
else
return false;
}

int main(){
int m, n;
double a, b;
while(scanf("%d%d", &m, &n) != EOF && m != -1 && n != -1){
for(int i = 0; i < n; i++){
scanf("%lf%lf", &a, &b);
t[i].j = a;
t[i].f = b;
}
sort(t, t+n, cmp);
double ans = 0;
for(int i = 0; i < n; i++){
if(m){
if(m < t[i].f){
ans += (t[i].j/t[i].f)*m;
m = 0;
}
else{
ans += t[i].j;
m -= t[i].f;
}
}
else{
break;
}
}
printf("%.3lf\n", ans);
}
return 0;
}


• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120