hdu 1009 整理下水题贪心

最新推荐文章于 2022-11-13 20:15:43 发布

__XINGLE

最新推荐文章于 2022-11-13 20:15:43 发布

阅读量549

点赞数

分类专栏：水题

本文链接：https://blog.csdn.net/qq_29055721/article/details/46507933

版权

水题专栏收录该内容

20 篇文章 0 订阅

订阅专栏

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

Sample Output

Author

CHEN, Yue

Source

ZJCPC2004

Recommend

JGShining

#include<stdio.h>
#include<algorithm>
using namespace std;
struct inf
{
    int f;
    int m;
    double arg;
} E[1000];
int cmp(inf x,inf y)
{
    return x.arg>y.arg;
}
int main()
{
    int n,a;
    int i,j,k;
    double t;
    while(scanf("%d%d",&n,&a) != EOF)
    {
        t = 0;
        if(n==-1&&a==-1)
            break;
        for(i=0; i<a; i++)
        {
            scanf("%d%d",&E[i].m,&E[i].f);
            E[i].arg=((double)E[i].m)/((double)E[i].f);
        }
        sort(E,E+a,cmp);
        for(i=0; i<a; i++)
        {
            if(n>E[i].f)
            {
                n=n-E[i].f;
                t=t+E[i].m;
            }
            else
            {
                t=t+n*E[i].arg;
                break;
            }
        }
        printf("%.3f\n",t);
    }
}