1009

最新推荐文章于 2018-11-14 02:07:02 发布

千与千与千

最新推荐文章于 2018-11-14 02:07:02 发布

阅读量466

点赞数

分类专栏：本科课程

本文链接：https://blog.csdn.net/liu_feng_zi_/article/details/64906362

版权

本科课程专栏收录该内容

267 篇文章 0 订阅

订阅专栏

本文介绍了一个算法，该算法帮助一只名为FatMouse的老鼠通过最优分配一定数量的猫粮来换取最大数量的JavaBeans。该算法接受猫粮和JavaBeans的数量作为输入，并通过排序和逐次选择最优交易比率的方法，计算出FatMouse能够获得的最大JavaBeans数量。

摘要由CSDN通过智能技术生成

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>
using namespace std;
void quickSort(int start,int eend);
int partSort(int s,int e);
double value[1000],J[1000],F[1000];
int main()
{
    int M,N;
    while(cin>>M>>N&&N<=1000&&M<=1000&&N!=-1&&M!=-1)
    {
        for(int i=0; i<N; i++)
        {
            cin>>J[i]>>F[i];
            value[i]=J[i]/F[i];
        }
        quickSort(0,N-1);
         double sum=0;
        for(int i=0; i<N&&M>0; i++)
        {
            if(M>=F[i])
            {
                sum+=J[i];
                M-=F[i];
            }
            else
            {
                sum+=M*value[i];
                M-=F[i];
            }
        }
        cout<<fixed<<setprecision(3)<<sum<<endl;
    }
    return 0;
}
void quickSort(int start,int eend)
{
    if(start<eend)
    {
        int j=partSort(start,eend);
        quickSort(start,j-1);
        quickSort(j+1,eend);
    }
}
int partSort(int s,int e)
{
    double x=value[s],temp;
    int l=s;
    e++;
    while(true)
    {
        while(value[++s]>x&&s<e);
        while(value[--e]<x);
        if(s>=e)
            break;
        temp=value[s];
        value[s]=value[e];
        value[e]=temp;
        temp=J[s];
        J[s]=J[e];
        J[e]=temp;
        temp=F[s];
        F[s]=F[e];
        F[e]=temp;
    }
    value[l]=value[e];
    value[e]=x;
    temp=J[l];
    J[l]=J[e];
    J[e]=temp;
    temp=F[l];
    F[l]=F[e];
    F[e]=temp;
    return e;
}