http://acm.hdu.edu.cn/showproblem.php?pid=1009
分析:贪心算法,类似一般背包问题
//hdu 1009 FatMouse' Trade
#include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;
#define M 10000+10
int m,n;
struct node{
int j,f;
double per;
}a[M];
bool cmp(node a,node b)
{
return a.per > b.per;
}
int main()
{
double ans;
while(scanf("%d%d",&m,&n)!=EOF){
if(m==-1&&n==-1) break;
for(int i=0;i<n;i++){
scanf("%d%d",&a[i].j,&a[i].f);
a[i].per=a[i].j*1.0/(a[i].f);
}
sort(a,a+n,cmp);
double tmp=m; ans=0;
// while(tmp){
for(int i=0;i<n&&tmp>0;i++){
if(tmp>=a[i].f){
ans+=a[i].j;
tmp-=a[i].f;
}
else{
ans+=(a[i].per*tmp);
tmp=0;
break;
}
//}*/
}
printf("%.3lf\n",ans);
}
return 0;
}
代码: