OJ - java

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/frankly01/article/details/71512403

订餐系统

//有限的金钱P和有限的菜品种类C
//相应的菜价格price对应相应的满足感value
//需要得到最好的Value

Code

public class Text1 {
    public static void main(String[] args) {

        Scanner input = new Scanner(System.in);     
        int p = input.nextInt();
        int c = input.nextInt();
        int f[]= new int [p+1];

        int price []= new int [c];
        int value []= new int [c];

        for (int i = 0 ;i<c;i++)
        {
            price[i] = input.nextInt();
            value[i] = input.nextInt();
        }

        for(int i = 0; i<c;i++){

            for (int j = p;j>=0;j--){
            if (j >= price[i])
                f[j] = Math.max(f[j], f[j-price[i]]+value[i]);

            }
        }       
        System.out.print(f[p]);     
    }

}