一些项目——FatMouse' Trade

标签：c++   数据   编程   cpp   c   

Problem Description

Input

Output

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 <stdio.h>
#include <iomanip>
#include <algorithm>
#include <cmath>
using namespace std;
struct Node
{
    double j,f,p;
} s[10000];
int cmp(Node x,Node y)
{
    return x.p>y.p;
}
int main()
{
    int n,i;
    double sum,m;
    while(~scanf("%lf%d",&m,&n) && (m!=-1 || n!=-1))
    {
        sum=0;
        for(i=0; i<n; ++i)
        {
            scanf("%lf%lf",&s[i].j,&s[i].f);
            s[i].p=s[i].j/s[i].f;
        }
        sort(s,s+n,cmp);
        for(i=0; i<n; ++i)
        {
            if(m>s[i].f)
            {
                sum+=s[i].j;
                m-=s[i].f;
            }
            else
            {
                sum+=s[i].p*m;
                break;
            }
        }
        printf("%.3lf\n",sum);
    }
    return 0;
}

一些项目——FatMouse' Trade

标签：c++   数据   编程   cpp   c   

原文地址：http://blog.csdn.net/blue_skyrim/article/details/46134893