贪心算法练习题FatMouse

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

刚开始的时候我并没有看懂是什么意思，后来才明白这是两组数据，m就是现在所拥有食物的数量，n几组数据，前面一个数是指能换取的JavaBeans的数量，后面的是指需要付出食物的数量。
解题思想：这其实就是背包问题，而且是可拆分背包问题，其中我们需要注意换取的过程中我们会有多余的食物留下，因为我们是换取得最大值因此我们需要将手中的十五全部换出，性价比就是我们的重要手段。

#include
#include
#include
#include
#include
using namespace std;
struct infor
{
int beans;
int food;
double xingjia;
}a[1005];
bool cmp(infor a,infor b)
{
return a.xingjia>b.xingjia;
}
int main()
{
int m,n;
while(cin>>m>>n&&m!=-1)
{
double sum=0;//清除数据，是循环过程中不对下一组数据造成影响。
for(int i=0;i<n;i++)
{
cin>>a[i].beans>>a[i].food;
a[i].xingjia=1.0a[i].beans/a[i].food;
}
sort(a,a+n,cmp);
for(int i=0;i<n;++i)
{
if(m>a[i].food)
{
sum+=a[i].beans;
m-=a[i].food;
}
else
{
sum+=ma[i].xingjia;
m=0;//将数据清除
}
}
cout<<fixed<<setprecision(3)<<sum<<endl;
}
}
在这之中要注意我们输入的数据是多组数据循环输入，这就势必要造成队后一组数据的影响，因此我们就要将这一组数据清除，以免影响下一组数据，还有数组的定义，避免数组爆掉内存。