FatMouse‘ Trade HDU - 1009

Fat Mouse 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.

把J和F组的结构体排一下序 其中有每一个的汇率 最后由高到低算一下
代码：

#include<bits/stdc++.h>
using namespace std;

struct R{
    int J, F;
    double v;
};

bool cmp(R a, R b){
    return a.v > b.v;
}
int main(){
    int N, M;
    while(cin >> M >> N){
        if(M < 0) break;
        R room[N];
        for(int i = 0; i < N; i++){
            cin >> room[i].J >>room[i].F;
            room[i].v = (double)room[i].J / (double)room[i].F;
        }
        sort(room , room+N , cmp);
        double sum = 0;
        int m = M;
        for(int i = 0; i < N; i++){
            if(m - room[i].F >= 0){
                m -= room[i].F;
                sum += room[i].J;
                //printf("%.3lf\n", sum);
            }
            else{
                sum += m*room[i].v;
                break;
                //printf("%.3lf\n", sum);
            }
        }
        printf("%.3lf\n", sum);
    }
    return 0;
}