题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1009
#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
struct food{
double j;
double f;
double aver;
}a[1010];
bool cmp(food a,food b)
{
return a.aver>b.aver;
}
int main()
{
int n,m,i;
while(scanf("%d%d",&m,&n)!=EOF&&(n!=-1&&m!=-1))
{
double sum=m,sum1=0;
for(i=0;i<n;i++)
{
scanf("%lf%lf",&a[i].j,&a[i].f);
if(a[i].f==0)
{
sum1+=a[i].j;
i--;
n--;
continue;
}
a[i].aver=a[i].j/a[i].f;
}
sort(a,a+n,cmp);
for(i=0;i<n;i++)
{
if(sum<=a[i].f)
{
sum1+=a[i].aver*sum;
break;
}
sum1+=a[i].j;
sum-=a[i].f;
}
printf("%.3lf\n",sum1);
}
return 0;
}