FatMouse' Trade(贪心)

FatMouse’ Trade
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 81024 Accepted Submission(s): 28031

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
//这里就说一点 这个得用double类型存储每一个单价 float 一直 wa了 改成double 就AC了

#include<iostream>
#include<stdio.h>
#include<algorithm>

using namespace std;
struct Lnode
{
    int w;
    int c;
    float p;
};
bool mycmp(Lnode a,Lnode b)
{
    return a.p > b.p;
}
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        if(n==-1&&m==-1)
            break;
        double sum =0;
        Lnode st[1007];
        for(int i=0;i<m;i++)
        {
            int w,c;
            scanf("%d%d",&w,&c);
            st[i].w = w;
            st[i].c = c;
            st[i].p = (double)w/c;
        }
        sort(st,st+m,mycmp);
        int cnt =0;
        while(n&&cnt<m)
        {
            if(n>st[cnt].c)
            {
                sum +=st[cnt].w;
                n -=st[cnt].c;
            }
            else
            {
                sum +=st[cnt].p * n;
                n =0;
                break;
            }
            cnt++;
        }
        printf("%.3lf\n",sum);
    }

    return 0;
}