HDU-1009 FatMouse‘ Trade

添加链接描述

#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
const int maxn=1005;
using namespace std;
struct sj{
      double a,b,c;
	  	};
bool cmp(sj y,sj z)
{
	if(y.c>z.c)
	return 1;
	else return 0;
	
}
sj a[maxn];
int main()
{
	double mob;
	int h,i;
	while(scanf("%lf %d",&mob,&h)!=EOF)
	{
		if(mob==-1&&h==-1)
		break;
		for(i=0;i<h;i++)
		{
			scanf("%lf%lf",&a[i].a,&a[i].b);
			a[i].c=a[i].a/a[i].b;
		}
		double sum=0;
		sort(a,a+h,cmp);
		for(i=0;i<h&&mob;i++)
		{
			if(mob>=a[i].b)
			{
				mob=mob-a[i].b;
				sum+=a[i].a;
			}
			else
			{
				sum+=mob*a[i].c;
				mob=0;
			}
		}
		printf("%.3lf\n",sum);     
	}
	return 0;
}