贪心法求解背包问题

背包问题的贪心算法实现，简答易懂if(m>=weight[i]){value=value+profit[i];m-=weight[i];s[i]=1;}elseif(m!=0){value=value+profit[i]*(1.0*m/weight[i]);s[i]=1.0*m/weight[i];m=0;}elsebreak;